Recognised as Number
24,977,635,004,169
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
24,977,635,004,169 is an odd 14-digit integer and a composite number. It has 15 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value24,977,635,004,169
Digit count14
Digit sum63
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, 4,997,763²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 555,307^2
Distinct prime factors23, 555,307
Number of divisors15
Sum of divisors σ(n)37,312,336,766,397
Aliquot sum12,334,701,762,228sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)16,651,726,682,868integers below n that share no factor with it
Carmichael function λ(n)2,775,287,780,478the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,651,726,682,868
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 555,307, 1,665,921, 4,997,763, 14,993,289, 44,979,867, 308,365,864,249, 925,097,592,747, 2,775,292,778,241, 8,325,878,334,723, 24,977,635,004,16915 in total
Arithmetic
Previous number24,977,635,004,168
Next number24,977,635,004,170
Double49,955,270,008,338
Square623,882,250,401,488,520,647,380,561
Cube15,583,103,136,107,948,827,344,041,001,332,164,558,809
Square root4,997,763exact
Cube root29,231.455361435≈
Negation-24,977,635,004,169
Reciprocal4.0035816 × 10^-14≈
Representations
Decimal24,977,635,004,169
Binary10110101101111000111100001111110011110000100145 bits
Octal553361703747411
Hexadecimal16B78F0FCF09
Base 368UQKEZ7K9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-four trillion, nine hundred and seventy-seven billion, six hundred and thirty-five million, four thousand, one hundred and sixty-nine
Ordinaltwenty-four trillion, nine hundred and seventy-seven billion, six hundred and thirty-five million, four thousand, one hundred and sixty-ninth
Scientific notation2.4977635 × 10^13
Engineering notation24.977635 × 10^12
In other bases
Ternary10021102211122022220010110000base 3; the most digit-efficient integer base after e: 29 digits
Quinary11233213144030113134base 5; one hand: 20 digits
Septenary5155401036323421base 7: 16 digits
Nonary107384568803400base 9; each digit is two ternary digits: 15 digits
Duodecimal29749bb512809base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal28fdfaifa89base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal8:55:21:26:39:5:36:9base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary101T11100TTT0T1000T0010110000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111100100010010011000100001101001100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000101101011011110001111000011111100111100001001
Bit length45 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits19within that length
Bit parityeven26 set bits, so even; not the same as the number itself being odd
Highest set bitbit 44worth 17,592,186,044,416
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes616 b7 8f 0f cf 09
Gray code111011110110001001000100010000010100010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000101101011011110001111000011111100111100001001
One's complement1111111111111111111010010100100001110000111100000011000011110110at 64 bits, every bit flipped
Bits reversed1001000011110011111100001111000111101101011010000000000000000000at 64 bits
Rotated left by 10000000000000000001011010110111100011110000111111001111000010010at 64 bits, wrapping
Shifted left by 11011010110111100011110000111111001111000010010= 49,955,270,008,338, no wrap
Shifted right by 110110101101111000111100001111110011110000100= 12,488,817,502,084, discarding the low bit
These bits as a double1.23405914 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime38
Nearest square below24,977,635,004,169
Nearest square above24,977,644,999,696
Powers & multiples
24,977,635,004,169 to the power 2623,882,250,401,488,520,647,380,561
24,977,635,004,169 to the power 3155831031361079488273440410013… (41 digits)
24,977,635,004,169 to the power 4389229062366025623382511514217… (54 digits)
24,977,635,004,169 to the power 5972202145279352038249979880930… (67 digits)
First ten multiples24,977,635,004,169, 49,955,270,008,338, 74,932,905,012,507, 99,910,540,016,676, 124,888,175,020,845, 149,865,810,025,014, 174,843,445,029,183, 199,821,080,033,352, 224,798,715,037,521, 249,776,350,041,690
Powers of twoBetween 2^44 (17,592,186,044,416) and 2^45 (35,184,372,088,832)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1280the total stopping time
Highest value reached160,037,366,467,1566× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps24,977,635,004,169 → 74,932,905,012,508 → 37,466,452,506,254 → 18,733,226,253,127 → 56,199,678,759,382 → 28,099,839,379,691 → 84,299,518,139,074 → 42,149,759,069,537 → 126,449,277,208,612 → 63,224,638,604,306 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage2.4977635 × 10^15%
24,977,635,004,169% as a decimal249,776,350,041.69
24,977,635,004,169% of 10024,977,635,004,169
24,977,635,004,169% of 1,000249,776,350,041,690
As a fraction of 10024,977,635,004,169/100
Read another way
As seconds791,493 years, 179 days and 11 hours
As bytes22.717 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 24,977,635,004,169
Nearby primes
Also reads as
24977635004169 (identifier)
- 14 characters
- Checksum fails
24977635004169 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