Recognised as Number

2,101,485

Positive
Odd
Composite
7 digits

2,101,485 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,101,485

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 29 × 4,831

Distinct prime factors43, 5, 29, 4,831

Number of divisors16

Sum of divisors σ(n)3,479,040

Aliquot sum1,377,555sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,081,920integers below n that share no factor with it

Carmichael function λ(n)9,660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,081,920

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 29, 87, 145, 435, 4,831, 14,493, 24,155, 72,465, 140,099, 420,297, 700,495, 2,101,48516 in total

Arithmetic

Previous number2,101,484

Next number2,101,486

Double4,202,970

Half1,050,742.5

Square4,416,239,205,225

Cube9,280,660,446,192,259,125

Square root1,449.649957748≈irrational, shown to 9 decimal places

Cube root128.088094467≈

Negation-2,101,485

Reciprocal4.75853979 × 10^-7≈

Representations

Decimal2,101,485

Binary100000000100001110110122 bits

Octal10010355

Hexadecimal2010ED

Base 36191IL

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo million, one hundred and one thousand, four hundred and eighty-five

Ordinaltwo million, one hundred and one thousand, four hundred and eighty-fifth

Scientific notation2.101485 × 10^6

Engineering notation2.101485 × 10^6

In other bases

Ternary10221202200210base 3; the most digit-efficient integer base after e: 14 digits

Quinary1014221420base 5; one hand: 10 digits

Septenary23601531base 7: 8 digits

Nonary3852623base 9; each digit is two ternary digits: 7 digits

Duodecimal854179base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimald2de5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal9:43:44:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1100TT10T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000000001000100111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000000001000011101101

Bit length22 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits14within that length

Bit parityeven8 set bits, so even; not the same as the number itself being odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes320 10 ed

Gray code1100000001100010011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000000001000011101101

64-bit0000000000000000000000000000000000000000001000000001000011101101

One's complement11111111110111111110111100010010at 32 bits, every bit flipped

Bits reversed10110111000010000000010000000000at 32 bits

Rotated left by 100000000010000000010000111011010at 32 bits, wrapping

Shifted left by 110000000010000111011010= 4,202,970, no wrap

Shifted right by 1100000000100001110110= 1,050,742, discarding the low bit

These bits as a double1.03827154 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,101,499+14

Previous prime2,101,483−2

Distance to nearest prime2

Nearest square below2,099,601

Nearest square above2,102,500

Powers & multiples

2,101,485 to the power 24,416,239,205,225

2,101,485 to the power 39,280,660,446,192,259,125

2,101,485 to the power 419,503,168,717,766,339,667,300,625

2,101,485 to the power 540,985,616,512,855,196,315,737,253,928,125

First ten multiples2,101,485, 4,202,970, 6,304,455, 8,405,940, 10,507,425, 12,608,910, 14,710,395, 16,811,880, 18,913,365, 21,014,850

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 85

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time

Highest value reached6,304,4563× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps2,101,485 → 6,304,456 → 3,152,228 → 1,576,114 → 788,057 → 2,364,172 → 1,182,086 → 591,043 → 1,773,130 → 886,565 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage210,148,500%

2,101,485% as a decimal21,014.85

2,101,485% of 1002,101,485

2,101,485% of 1,00021,014,850

As a fraction of 1002,101,485/100

Read another way

As seconds24 days, 7 hours and 44 minutes

As bytes2.004 MiB

As a 24-bit colour#2010ED

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.