Compare photos by overlapping


XC60 Recharge T8 AWD Inscription vs NBOX G Honda SENSING




<First car selection>

VOLVO

XC60 Recharge T8 AWD Inscription 2022- 11309

<Second car selection>

HONDA

N-BOX G Honda SENSING 2017- 61301





Size comparison


A : XC60 Recharge T8 AWD Inscription 2022-
B : N-BOX G Honda SENSING 2017-

name length width height
A 4710mm 1900mm 1660mm
B 3395mm 1475mm 1790mm
difference +1315mm +425mm -130mm

name weight Minimum turning radius Drive battery capacity
A 2160kg 5.7m 12kWh
B 890kg 4.5m kWh
difference +1270kg +1.2m +12kWh

name Cargo Volume Drive battery capacity cruising range
A 505L 12kWh 40km
B L kWh km
difference +505L +12kWh +40km


Max output comparison
name Gasoline engine power Gasoline engine torque Displacement
A 233kW(317PS)400Nm1968cc
B 43kW(58PS)65Nm-
difference +190kW+335Nm-


EV performance comparison
name Electric motor power Electric motor torque
A kW Nm
B kW Nm
difference +0kW +0Nm


name Drive battery capacity cruising range Acceleration 0-100km/h
A 12kWh 40km sec
B kWh km sec
difference +12kWh +40km +0sec


VOLVO XC60 Recharge T8 AWD Inscription 2022-
Car manufacturer website
Volvo's first Google-approved car. By making the car's OS Google, users themselves can update the car's software. You can access the Internet using the standard communication equipment installed in your car. Of course, you can use Google Maps, but you can also use various apps such as Spotify. There are few apps that can be used yet, but it is expected that they will increase in the future.
Even for Google, it's the first attempt as an OS for a car, so I can't shake the feeling that I haven't reached the itchy place yet. I would like to expect that it will be refined as an OS for cars in the future, just as the support for other languages is progressing.










HONDA N-BOX G Honda SENSING 2017-
Car manufacturer website
















VOLVO XC60 Recharge T8 AWD Inscription 2022-

>>Compare photos by overlapping


new!




SUV   MPV   Hatchback   Wagon   Sedan Coupe
<< < 1 >

Order of longest length
<< < 1 >



Back to top