Recognised as Number
15,788,447,947,025
- Positive
- Odd
- Composite
- 14 digits
15,788,447,947,025 is an odd 14-digit integer and a composite number. It has 24 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value15,788,447,947,025
Digit count14
Digit sum71
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 13 × 61 × 796,390,817
Distinct prime factors45, 13, 61, 796,390,817
Number of divisors24
Sum of divisors σ(n)21,429,284,130,744
Aliquot sum5,640,836,183,719sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)11,468,027,750,400integers below n that share no factor with it
Carmichael function λ(n)11,945,862,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,468,027,750,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 13, 25, 61, 65, 305, 325, 793, 1,525, 3,965, 19,825, 796,390,817, 3,981,954,085, 10,353,080,621, 19,909,770,425, 48,579,839,837, 51,765,403,105, 242,899,199,185, 258,827,015,525, 631,537,917,881, 1,214,495,995,925, 3,157,689,589,405, 15,788,447,947,02524 in total
Arithmetic
Previous number15,788,447,947,024
Next number15,788,447,947,026
Double31,576,895,894,050
Square249,275,088,575,917,937,206,350,625
Cube3,935,666,760,470,926,586,540,479,389,073,575,640,625
Square root3,973,468.00000013≈irrational, shown to 9 decimal places
Cube root25,086.87003268≈
Negation-15,788,447,947,025
Reciprocal6.33374479 × 10^-14≈
Representations
Decimal15,788,447,947,025
Binary1110010111000000100011010100110110010001000144 bits
Octal345601065154421
HexadecimalE5C08D4D911
Base 365LH429FKH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifteen trillion, seven hundred and eighty-eight billion, four hundred and forty-seven million, nine hundred and forty-seven thousand and twenty-five
Ordinalfifteen trillion, seven hundred and eighty-eight billion, four hundred and forty-seven million, nine hundred and forty-seven thousand and twenty-fifth
Scientific notation1.57884479 × 10^13
Engineering notation15.788448 × 10^12
In other bases
Ternary2001220100202002021000200022base 3; the most digit-efficient integer base after e: 28 digits
Quinary4032134220133301100base 5; one hand: 19 digits
Septenary3216451313153645base 7: 16 digits
Nonary61810662230608base 9; each digit is two ternary digits: 14 digits
Duodecimal192baa7332815base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1agee9jd7b5base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal5:38:24:4:26:25:17:5base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T01T0T0101T1T01T1T1001T0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100111010110000011001110101010010100100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000011100101110000001000110101001101100100010001
Bit length44 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits25within that length
Bit parityodd19 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
Bytes60e 5c 08 d4 d9 11
Gray code10010111001000001100101111101011010110011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000011100101110000001000110101001101100100010001
One's complement1111111111111111111100011010001111110111001010110010011011101110at 64 bits, every bit flipped
Bits reversed1000100010011011001010110001000000111010011100000000000000000000at 64 bits
Rotated left by 10000000000000000000111001011100000010001101010011011001000100010at 64 bits, wrapping
Shifted left by 1111001011100000010001101010011011001000100010= 31,576,895,894,050, no wrap
Shifted right by 11110010111000000100011010100110110010001000= 7,894,223,973,512, discarding the low bit
These bits as a double7.80052973 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime22
Nearest square below15,788,447,947,024
Nearest square above15,788,455,893,961
Powers & multiples
15,788,447,947,025 to the power 2249,275,088,575,917,937,206,350,625
15,788,447,947,025 to the power 33,935,666,760,470,926,586,540,479,389,073,575,640,625
15,788,447,947,025 to the power 4621380697845317332874645228074… (53 digits)
15,788,447,947,025 to the power 5981063680321686228523434099287… (66 digits)
First ten multiples15,788,447,947,025, 31,576,895,894,050, 47,365,343,841,075, 63,153,791,788,100, 78,942,239,735,125, 94,730,687,682,150, 110,519,135,629,175, 126,307,583,576,200, 142,096,031,523,225, 157,884,479,470,250
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 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached47,365,343,841,0763× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,788,447,947,025 → 47,365,343,841,076 → 23,682,671,920,538 → 11,841,335,960,269 → 35,524,007,880,808 → 17,762,003,940,404 → 8,881,001,970,202 → 4,440,500,985,101 → 13,321,502,955,304 → 6,660,751,477,652 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.57884479 × 10^15%
15,788,447,947,025% as a decimal157,884,479,470.25
15,788,447,947,025% of 10015,788,447,947,025
15,788,447,947,025% of 1,000157,884,479,470,250
As a fraction of 10015,788,447,947,025/100
Read another way
As seconds500,305 years, 264 days and 19 hours
As bytes14.36 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 15,788,447,947,025
Nearby primes
Also reads as
15788447947025 (identifier)
- 14 characters
- Checksum fails
15788447947025 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