Recognised as Number
12,987,165,420,441
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
12,987,165,420,441 is an odd 14-digit integer and a composite number. It has 27 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value12,987,165,420,441
Digit count14
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
Perfect squareYes, 3,603,771²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^8 × 44,491^2
Distinct prime factors23, 44,491
Number of divisors27
Sum of divisors σ(n)19,480,196,251,893
Aliquot sum6,493,030,831,452sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,657,915,676,660integers below n that share no factor with it
Carmichael function λ(n)1,442,985,946,110the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,657,915,676,660
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 243, 729, 2,187, 6,561, 44,491, 133,473, 400,419, 1,201,257, 3,603,771, 10,811,313, 32,433,939, 97,301,817, 291,905,451, 1,979,449,081, 5,938,347,243, 17,815,041,729, 53,445,125,187, 160,335,375,561, 481,006,126,683, 1,443,018,380,049, 4,329,055,140,147, 12,987,165,420,44127 in total
Arithmetic
Previous number12,987,165,420,440
Next number12,987,165,420,442
Double25,974,330,840,882
Square168,666,465,657,898,456,300,634,481
Cube2,190,499,290,380,258,292,894,114,474,931,426,826,121
Square root3,603,771exact
Cube root23,505.60628002≈
Negation-12,987,165,420,441
Reciprocal7.69990962 × 10^-14≈
Representations
Decimal12,987,165,420,441
Binary1011110011111100111101100001101010111001100144 bits
Octal274771730325631
HexadecimalBCFCF61AB99
Base 364LQ7YZ0K9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve trillion, nine hundred and eighty-seven billion, one hundred and sixty-five million, four hundred and twenty thousand, four hundred and forty-one
Ordinaltwelve trillion, nine hundred and eighty-seven billion, one hundred and sixty-five million, four hundred and twenty thousand, four hundred and forty-first
Scientific notation1.29871654 × 10^13
Engineering notation12.987165 × 10^12
In other bases
Ternary1200222120010212222100000000base 3; the most digit-efficient integer base after e: 28 digits
Quinary3200240203321423231base 5; one hand: 19 digits
Septenary2510202031440162base 7: 16 digits
Nonary50876125870000base 9; each digit is two ternary digits: 14 digits
Duodecimal1558bbb509509base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1576493hb21base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:38:21:36:5:50:7:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT01000TT00110T000T100000000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111001101000011010000101001101111110011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010111100111111001111011000011010101110011001
Bit length44 bitsto write the magnitude
Set bits27the population count, or Hamming weight
Zero bits17within that length
Bit parityodd27 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes60b cf cf 61 ab 99
Gray code11100010100000101000110100010111111001010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010111100111111001111011000011010101110011001
One's complement1111111111111111111101000011000000110000100111100101010001100110at 64 bits, every bit flipped
Bits reversed1001100111010101100001101111001111110011110100000000000000000000at 64 bits
Rotated left by 10000000000000000000101111001111110011110110000110101011100110010at 64 bits, wrapping
Shifted left by 1101111001111110011110110000110101011100110010= 25,974,330,840,882, no wrap
Shifted right by 11011110011111100111101100001101010111001100= 6,493,582,710,220, discarding the low bit
These bits as a double6.41651227 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime62
Nearest square below12,987,165,420,441
Nearest square above12,987,172,627,984
Powers & multiples
12,987,165,420,441 to the power 2168,666,465,657,898,456,300,634,481
12,987,165,420,441 to the power 32,190,499,290,380,258,292,894,114,474,931,426,826,121
12,987,165,420,441 to the power 4284483766375270393392003691375… (53 digits)
12,987,165,420,441 to the power 5369463773334572773718192108862… (66 digits)
First ten multiples12,987,165,420,441, 25,974,330,840,882, 38,961,496,261,323, 51,948,661,681,764, 64,935,827,102,205, 77,922,992,522,646, 90,910,157,943,087, 103,897,323,363,528, 116,884,488,783,969, 129,871,654,204,410
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1452the total stopping time
Highest value reached43,831,683,293,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,987,165,420,441 → 38,961,496,261,324 → 19,480,748,130,662 → 9,740,374,065,331 → 29,221,122,195,994 → 14,610,561,097,997 → 43,831,683,293,992 → 21,915,841,646,996 → 10,957,920,823,498 → 5,478,960,411,749 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.29871654 × 10^15%
12,987,165,420,441% as a decimal129,871,654,204.41
12,987,165,420,441% of 10012,987,165,420,441
12,987,165,420,441% of 1,000129,871,654,204,410
As a fraction of 10012,987,165,420,441/100
Read another way
As seconds411,538 years, 160 days and 2 hours
As bytes11.812 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,987,165,420,441
Nearby primes
Also reads as
12987165420441 (identifier)
- 14 characters
- Checksum fails
12987165420441 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