Recognised as Number
12,564,000,000,000
- Positive
- Even
- Composite
- 14 digits
12,564,000,000,000 is an even 14-digit integer and a composite number. It has 720 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value12,564,000,000,000
Digit count14
Digit sum18
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 numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^11 × 3^2 × 5^9 × 349
Distinct prime factors42, 3, 5, 349
Number of divisors720
Sum of divisors σ(n)45,488,886,943,500
Aliquot sum32,924,886,943,500sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)3,340,800,000,000integers below n that share no factor with it
Carmichael function λ(n)17,400,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,340,800,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors720 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number12,563,999,999,999
Next number12,564,000,000,001
Double25,128,000,000,000
Square157,854,096,000,000,000,000,000,000
Cube1,983,278,862,144,000,000,000,000,000,000,000,000,000
Square root3,544,573.31705806≈irrational, shown to 9 decimal places
Cube root23,247.484986366≈
Negation-12,564,000,000,000
Reciprocal7.95924865 × 10^-14≈
Representations
Decimal12,564,000,000,000
Binary1011011011010100100011000001110010000000000044 bits
Octal266651060344000
HexadecimalB6D48C1C800
Base 364GBTL7GG0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve trillion, five hundred and sixty-four billion
Ordinaltwelve trillion, five hundred and sixty-four billionth
Scientific notation1.2564 × 10^13
Engineering notation12.564 × 10^12
In other bases
Ternary1122111002212202120200020100base 3; the most digit-efficient integer base after e: 28 digits
Quinary3121322033000000000base 5; one hand: 19 digits
Septenary2434501426633221base 7: 16 digits
Nonary48432782520210base 9; each digit is two ternary digits: 14 digits
Duodecimal14aaba2219400base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal14afca00000base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:29:17:24:26:40:0:0base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT0T1110100T0T10TT1T001T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111001011110101011001110001101101100000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010110110110101001000110000011100100000000000
Bit length44 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits28within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 1111 trailing zeros
Power of twoNo
Bytes60b 6d 48 c1 c8 00
Gray code11101101101111101100101000010010110000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010110110110101001000110000011100100000000000
One's complement1111111111111111111101001001001010110111001111100011011111111111at 64 bits, every bit flipped
Bits reversed0000000000010011100000110001001010110110110100000000000000000000at 64 bits
Rotated left by 10000000000000000000101101101101010010001100000111001000000000000at 64 bits, wrapping
Shifted left by 1101101101101010010001100000111001000000000000= 25,128,000,000,000, no wrap
Shifted right by 11011011011010100100011000001110010000000000= 6,282,000,000,000, discarding the low bit
These bits as a double6.20744077 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime17
Nearest square below12,563,997,752,329
Nearest square above12,564,004,841,476
Powers & multiples
12,564,000,000,000 to the power 2157,854,096,000,000,000,000,000,000
12,564,000,000,000 to the power 31,983,278,862,144,000,000,000,000,000,000,000,000,000
12,564,000,000,000 to the power 4249179156239772160000000000000… (53 digits)
12,564,000,000,000 to the power 5313068691899649741824000000000… (66 digits)
First ten multiples12,564,000,000,000, 25,128,000,000,000, 37,692,000,000,000, 50,256,000,000,000, 62,820,000,000,000, 75,384,000,000,000, 87,948,000,000,000, 100,512,000,000,000, 113,076,000,000,000, 125,640,000,000,000
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
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 11No, remainder 9
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1248the total stopping time
Highest value reached12,564,000,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,564,000,000,000 → 6,282,000,000,000 → 3,141,000,000,000 → 1,570,500,000,000 → 785,250,000,000 → 392,625,000,000 → 196,312,500,000 → 98,156,250,000 → 49,078,125,000 → 24,539,062,500 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.2564 × 10^15%
12,564,000,000,000% as a decimal125,640,000,000
12,564,000,000,000% of 10012,564,000,000,000
12,564,000,000,000% of 1,000125,640,000,000,000
As a fraction of 10012,564,000,000,000/100
Read another way
As seconds398,129 years, 49 days and 10 hours
As bytes11.427 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 12,564,000,000,000
Nearby primes
Also reads as
12564000000000 (identifier)
- 14 characters
- Checksum fails
12564000000000 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-14 (case/carton)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page