Recognised as Number
3,466,913,218,560,000,000
- Positive
- Even
- Composite
- 19 digits
3,466,913,218,560,000,000 is an even 19-digit integer and a composite number. It has 10,560 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,466,913,218,560,000,000
Digit count19
Digit sum54
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^21 × 3^4 × 5^7 × 11^2 × 17 × 127
Distinct prime factors62, 3, 5, 11, 17, 127
Number of divisors10,560
Sum of divisors σ(n)15,187,217,710,898,128,896
Aliquot sum11,720,304,492,338,128,896sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)784,796,221,440,000,000integers below n that share no factor with it
Carmichael function λ(n)17,031,168,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 784,796,221,440,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors10,560 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number3,466,913,218,559,999,999
Next number3,466,913,218,560,000,001
Square12,019,487,265,026,058,328,473,600,000,000,000,000
Cube41,670,519,279,432,423,601,838,702,267,990,016,000,000,000,000,000,000,000
Square root1,861,964,881≈irrational, shown to 9 decimal places
Cube root1,513,494≈
Negation-3,466,913,218,560,000,000
Representations
Decimal3,466,913,218,560,000,000
Binary1100000001110011110011001101000010101101100000000000000000000062 bits
Octal300347463205330000000
Hexadecimal301CF3342B600000
Base 36QC8M61FNY800
In wordsthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and eighteen billion, five hundred and sixty million
Ordinalthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and eighteen billion, five hundred and sixty millionth
Engineering notation3.466913 × 10^18
In other bases
Ternary212002122120111222211210201100210020000base 3; the most digit-efficient integer base after e: 39 digits
Quinary213040310222133102330000000base 5; one hand: 27 digits
Septenary6131004232154250556311base 7: 22 digits
Nonary25078514884721323200base 9; each digit is two ternary digits: 20 digits
Duodecimal169031480292280000base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 18 digits
Vigesimal22685ehc0000000base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits
Sexagesimal5:44:1:6:22:13:20:0:0:0:0base 60; Babylonian, and still how an hour and a circle are divided: 11 digits
Balanced ternary10TT010T00TT1TTT0000TTT11T01101T101T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000001101101001101110111010001111100101000000000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0011000000011100111100110011010000101011011000000000000000000000
Bit length62 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits42within that length
Bit parityeven20 set bits, so even; not the same as the number itself being even
Highest set bitbit 61worth 2,305,843,009,213,693,952
Lowest set bitbit 2121 trailing zeros
Power of twoNo
Bytes830 1c f3 34 2b 60 00 00
Gray code10100000010010100010101010111000111110110100000000000000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0011000000011100111100110011010000101011011000000000000000000000
One's complement1100111111100011000011001100101111010100100111111111111111111111at 64 bits, every bit flipped
Bits reversed0000000000000000000001101101010000101100110011110011100000001100at 64 bits
Rotated left by 10110000000111001111001100110100001010110110000000000000000000000at 64 bits, wrapping
Shifted left by 1110000000111001111001100110100001010110110000000000000000000000= 6,933,826,437,120,000,000, no wrap
Shifted right by 11100000001110011110011001101000010101101100000000000000000000= 1,733,456,609,280,000,000, discarding the low bit
These bits as a double6.25043019 × 10^-77≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)
Nearest landmarks
Distance to nearest prime19
Nearest square below3,466,913,218,077,344,161
Nearest square above3,466,913,221,801,273,924
Powers & multiples
3,466,913,218,560,000,000 to the power 212,019,487,265,026,058,328,473,600,000,000,000,000
3,466,913,218,560,000,000 to the power 3416705192794324236018387022679… (56 digits)
3,466,913,218,560,000,000 to the power 4144468074114123595719471923213… (75 digits)
3,466,913,218,560,000,000 to the power 5500858275806160855989434644173… (93 digits)
First ten multiples3,466,913,218,560,000,000, 6,933,826,437,120,000,000, 10,400,739,655,680,000,000, 13,867,652,874,240,000,000, 17,334,566,092,800,000,000, 20,801,479,311,360,000,000, 24,268,392,529,920,000,000, 27,735,305,748,480,000,000, 31,202,218,967,040,000,000, 34,669,132,185,600,000,000
Powers of twoBetween 2^61 (2,305,843,009,213,693,952) and 2^62 (4,611,686,018,427,387,904)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11Yes
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1372the total stopping time
Highest value reached3,466,913,218,560,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,466,913,218,560,000,000 → 1,733,456,609,280,000,000 → 866,728,304,640,000,000 → 433,364,152,320,000,000 → 216,682,076,160,000,000 → 108,341,038,080,000,000 → 54,170,519,040,000,000 → 27,085,259,520,000,000 → 13,542,629,760,000,000 → 6,771,314,880,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 3,466,913,218,560,000,000
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page