Recognised as Number
15,788,447,947,024
- Positive
- Even
- Composite
- Perfect square
- 14 digits
15,788,447,947,024 is an even 14-digit integer and a composite number. It has 15 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value15,788,447,947,024
Digit count14
Digit sum70
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,973,468²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 993,367^2
Distinct prime factors22, 993,367
Number of divisors15
Sum of divisors σ(n)30,590,148,691,767
Aliquot sum14,801,700,744,743sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,894,216,026,576integers below n that share no factor with it
Carmichael function λ(n)1,973,554,006,644the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,894,216,026,576
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 993,367, 1,986,734, 3,973,468, 7,946,936, 15,893,872, 986,777,996,689, 1,973,555,993,378, 3,947,111,986,756, 7,894,223,973,512, 15,788,447,947,02415 in total
Arithmetic
Previous number15,788,447,947,023
Next number15,788,447,947,025
Double31,576,895,894,048
Square249,275,088,575,886,360,310,456,576
Cube3,935,666,760,470,178,761,274,751,682,627,300,429,824
Square root3,973,468exact
Cube root25,086.87003268≈
Negation-15,788,447,947,024
Reciprocal6.33374479 × 10^-14≈
Representations
Decimal15,788,447,947,024
Binary1110010111000000100011010100110110010001000044 bits
Octal345601065154420
HexadecimalE5C08D4D910
Base 365LH429FKG
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-four
Ordinalfifteen trillion, seven hundred and eighty-eight billion, four hundred and forty-seven million, nine hundred and forty-seven thousand and twenty-fourth
Scientific notation1.57884479 × 10^13
Engineering notation15.788448 × 10^12
In other bases
Ternary2001220100202002021000200021base 3; the most digit-efficient integer base after e: 28 digits
Quinary4032134220133301044base 5; one hand: 19 digits
Septenary3216451313153644base 7: 16 digits
Nonary61810662230607base 9; each digit is two ternary digits: 14 digits
Duodecimal192baa7332814base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1agee9jd7b4base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal5:38:24:4:26:25:17:4base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T01T0T0101T1T01T1T1001T001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100111010110000011001110101010010100100010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000011100101110000001000110101001101100100010000
Bit length44 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits26within that length
Bit parityeven18 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 44 trailing zeros
Power of twoNo
Bytes60e 5c 08 d4 d9 10
Gray code10010111001000001100101111101011010110011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000011100101110000001000110101001101100100010000
One's complement1111111111111111111100011010001111110111001010110010011011101111at 64 bits, every bit flipped
Bits reversed0000100010011011001010110001000000111010011100000000000000000000at 64 bits
Rotated left by 10000000000000000000111001011100000010001101010011011001000100000at 64 bits, wrapping
Shifted left by 1111001011100000010001101010011011001000100000= 31,576,895,894,048, 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 prime21
Nearest square below15,788,447,947,024
Nearest square above15,788,455,893,961
Powers & multiples
15,788,447,947,024 to the power 2249,275,088,575,886,360,310,456,576
15,788,447,947,024 to the power 33,935,666,760,470,178,761,274,751,682,627,300,429,824
15,788,447,947,024 to the power 4621380697845159906204226405967… (53 digits)
15,788,447,947,024 to the power 5981063680321375538174511479977… (66 digits)
First ten multiples15,788,447,947,024, 31,576,895,894,048, 47,365,343,841,072, 63,153,791,788,096, 78,942,239,735,120, 94,730,687,682,144, 110,519,135,629,168, 126,307,583,576,192, 142,096,031,523,216, 157,884,479,470,240
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 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 24
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached15,788,447,947,024
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps15,788,447,947,024 → 7,894,223,973,512 → 3,947,111,986,756 → 1,973,555,993,378 → 986,777,996,689 → 2,960,333,990,068 → 1,480,166,995,034 → 740,083,497,517 → 2,220,250,492,552 → 1,110,125,246,276 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.57884479 × 10^15%
15,788,447,947,024% as a decimal157,884,479,470.24
15,788,447,947,024% of 10015,788,447,947,024
15,788,447,947,024% of 1,000157,884,479,470,240
As a fraction of 10015,788,447,947,024/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,024
Nearby primes
Also reads as
15788447947024 (identifier)
- 14 characters
- Checksum fails
15788447947024 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