Recognised as Number
2,010,000,000,000,000,000
- Positive
- Even
- Composite
- 19 digits
2,010,000,000,000,000,000 is an even 19-digit integer and a composite number. It has 1,156 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,010,000,000,000,000,000
Digit count19
Digit sum3
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^16 × 3 × 5^16 × 67
Distinct prime factors42, 3, 5, 67
Number of divisors1,156
Sum of divisors σ(n)6,799,948,120,108,274,672
Aliquot sum4,789,948,120,108,274,672sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)528,000,000,000,000,000integers below n that share no factor with it
Carmichael function λ(n)16,500,000,000,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 528,000,000,000,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1,156 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number2,009,999,999,999,999,999
Next number2,010,000,000,000,000,001
Square4,040,100,000,000,000,000,000,000,000,000,000,000
Cube8,120,601,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
Square root1,417,744,687≈irrational, shown to 9 decimal places
Cube root1,262,017≈
Negation-2,010,000,000,000,000,000
Representations
Decimal2,010,000,000,000,000,000
Binary110111110010011110100010110011011111010001001000000000000000061 bits
Octal157447505467642200000
Hexadecimal1BE4F459BE890000
Base 36F9R9J8KPWLXC
In wordstwo quintillion, ten quadrillion
Ordinaltwo quintillion, ten quadrillionth
Engineering notation2.01 × 10^18
In other bases
Ternary111101120102220101101100021102121222110base 3; the most digit-efficient integer base after e: 39 digits
Quinary113330114210000000000000000base 5; one hand: 27 digits
Septenary3412221145530130212606base 7: 22 digits
Nonary14346386341307377873base 9; each digit is two ternary digits: 20 digits
Duodecimalaa562a61b1b6a4540base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 17 digits
Vigesimal14ae91500000000base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits
Sexagesimal3:19:27:1:15:43:12:35:33:20:0base 60; Babylonian, and still how an hour and a circle are divided: 11 digits
Balanced ternary11111TTT01100T01011011001T1110T0T00T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110110000100101001101011010111011000011100110010000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0001101111100100111101000101100110111110100010010000000000000000
Bit length61 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits35within that length
Bit parityeven26 set bits, so even; not the same as the number itself being even
Highest set bitbit 60worth 1,152,921,504,606,846,976
Lowest set bitbit 1616 trailing zeros
Power of twoNo
Bytes81b e4 f4 59 be 89 00 00
Gray code1011000010110100011100111010101100001110011011000000000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0001101111100100111101000101100110111110100010010000000000000000
One's complement1110010000011011000010111010011001000001011101101111111111111111at 64 bits, every bit flipped
Bits reversed0000000000000000100100010111110110011010001011110010011111011000at 64 bits
Rotated left by 10011011111001001111010001011001101111101000100100000000000000000at 64 bits, wrapping
Shifted left by 111011111001001111010001011001101111101000100100000000000000000= 4,020,000,000,000,000,000, no wrap
Shifted right by 1110111110010011110100010110011011111010001001000000000000000= 1,005,000,000,000,000,000, discarding the low bit
These bits as a double2.64758374 × 10^-174≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)
Nearest landmarks
Distance to nearest prime17
Nearest square below2,009,999,997,516,727,969
Nearest square above2,010,000,000,352,217,344
Powers & multiples
2,010,000,000,000,000,000 to the power 24,040,100,000,000,000,000,000,000,000,000,000,000
2,010,000,000,000,000,000 to the power 3812060100000000000000000000000… (55 digits)
2,010,000,000,000,000,000 to the power 4163224080100000000000000000000… (74 digits)
2,010,000,000,000,000,000 to the power 5328080401001000000000000000000… (92 digits)
First ten multiples2,010,000,000,000,000,000, 4,020,000,000,000,000,000, 6,030,000,000,000,000,000, 8,040,000,000,000,000,000, 10,050,000,000,000,000,000, 12,060,000,000,000,000,000, 14,070,000,000,000,000,000, 16,080,000,000,000,000,000, 18,090,000,000,000,000,000, 20,100,000,000,000,000,000
Powers of twoBetween 2^60 (1,152,921,504,606,846,976) and 2^61 (2,305,843,009,213,693,952)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1286the total stopping time
Highest value reached2,010,000,000,000,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,010,000,000,000,000,000 → 1,005,000,000,000,000,000 → 502,500,000,000,000,000 → 251,250,000,000,000,000 → 125,625,000,000,000,000 → 62,812,500,000,000,000 → 31,406,250,000,000,000 → 15,703,125,000,000,000 → 7,851,562,500,000,000 → 3,925,781,250,000,000 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 2,010,000,000,000,000,000
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page