Nerdulator> put something in

Roman numeral converter

Convert between Roman numerals and their integer values.

Showing a worked example. Change the values and the result updates, and the answer lives in the URL.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,026
Digit count4
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 1,013
Distinct prime factors22, 1,013
Number of divisors4
Sum of divisors σ(n)3,042
Aliquot sum1,016sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,012integers below n that share no factor with it
Carmichael function λ(n)1,012the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,013, 2,0264 in total

Arithmetic

Previous number2,025
Next number2,027
Double4,052
Half1,013
Square4,104,676
Square root45.01110974≈irrational, shown to 9 decimal places
Cube root12.653572187≈
Negation-2,026
Reciprocal0.0004935834≈

Representations

Decimal2,026
Binary1111110101011 bits
Octal3752
Hexadecimal7EA
Base 361KA
Roman numeralMMXXVI
In wordstwo thousand and twenty-six
Ordinaltwo thousand and twenty-sixth
Scientific notation2.026 × 10^3
Engineering notation2.026 × 10^3

In other bases

Ternary2210001base 3; the most digit-efficient integer base after e: 7 digits
Quinary31101base 5; one hand: 5 digits
Septenary5623base 7: 4 digits
Nonary2701base 9; each digit is two ternary digits: 4 digits
Duodecimal120abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal516base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal33:46base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternary10T10001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000011111101010
Bit length11 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits3within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 10worth 1,024
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes207 ea
Gray code10000011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0000011111101010
32-bit00000000000000000000011111101010
64-bit0000000000000000000000000000000000000000000000000000011111101010
One's complement1111100000010101at 16 bits, every bit flipped
Bits reversed0101011111100000at 16 bits
Rotated left by 10000111111010100at 16 bits, wrapping
Shifted left by 1111111010100= 4,052, no wrap
Shifted right by 11111110101= 1,013, discarding the low bit
These bits as a double1.000977 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,027+1
Previous prime2,017−9
Distance to nearest prime1
Nearest square below2,025
Nearest square above2,116

Powers & multiples

2,026 to the power 24,104,676
2,026 to the power 38,316,073,576
2,026 to the power 416,848,365,064,976
2,026 to the power 534,134,787,621,641,376
First ten multiples2,026, 4,052, 6,078, 8,104, 10,130, 12,156, 14,182, 16,208, 18,234, 20,260
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 26

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time
Highest value reached9,2324× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,026 → 1,013 → 3,040 → 1,520 → 760 → 380 → 190 → 95 → 286 → 143 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage202,600%
2,026% as a decimal20.26
2,026% of 1002,026
2,026% of 1,00020,260
As a fraction of 1002,026/100

Read another way

As bytes1.979 KiB
As a year2026 AD
As a 24-bit colour#0007EA

All calculators →