Recognised as Number
57,661,163,366,400
- Positive
- Even
- Composite
- 14 digits
57,661,163,366,400 is an even 14-digit integer and a composite number. It has 2,880 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value57,661,163,366,400
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
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^11 × 3^4 × 5^2 × 11 × 17 × 149 × 499
Distinct prime factors72, 3, 5, 11, 17, 149, 499
Number of divisors2,880
Sum of divisors σ(n)248,837,589,000,000
Aliquot sum191,176,425,633,600sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)13,041,716,428,800integers below n that share no factor with it
Carmichael function λ(n)212,267,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,041,716,428,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors2,880 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number57,661,163,366,399
Next number57,661,163,366,401
Double115,322,326,732,800
Square3,324,809,760,766,669,380,648,960,000
Cube191,712,398,777,768,224,469,616,389,410,258,944,000,000
Square root7,593,494.80584533≈irrational, shown to 9 decimal places
Cube root38,633.240127598≈
Negation-57,661,163,366,400
Reciprocal1.73426955 × 10^-14≈
Representations
Decimal57,661,163,366,400
Binary110100011100010100100100101000111010000000000046 bits
Octal1507051112164000
Hexadecimal34714928E800
Base 36KFT67WG00
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-seven trillion, six hundred and sixty-one billion, one hundred and sixty-three million, three hundred and sixty-six thousand, four hundred
Ordinalfifty-seven trillion, six hundred and sixty-one billion, one hundred and sixty-three million, three hundred and sixty-six thousand, four hundredth
Scientific notation5.76611634 × 10^13
Engineering notation57.661163 × 10^12
In other bases
Ternary21120011100112121122020110000base 3; the most digit-efficient integer base after e: 29 digits
Quinary30024210030310211100base 5; one hand: 20 digits
Septenary15100611244524666base 7: 17 digits
Nonary246140477566400base 9; each digit is two ternary digits: 15 digits
Duodecimal6573152b40000base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal5cc7fdb0g00base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal20:35:52:43:50:24:0:0base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary10TTT0011101TT0T0TT0T1T0110000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011011000101011001011110010011100000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000001101000111000101001001001010001110100000000000
Bit length46 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits30within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 45worth 35,184,372,088,832
Lowest set bitbit 1111 trailing zeros
Power of twoNo
Bytes634 71 49 28 e8 00
Gray code1011100100100111101101101111001001110000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000001101000111000101001001001010001110100000000000
One's complement1111111111111111110010111000111010110110110101110001011111111111at 64 bits, every bit flipped
Bits reversed0000000000010111000101001001001010001110001011000000000000000000at 64 bits
Rotated left by 10000000000000000011010001110001010010010010100011101000000000000at 64 bits, wrapping
Shifted left by 111010001110001010010010010100011101000000000000= 115,322,326,732,800, no wrap
Shifted right by 1110100011100010100100100101000111010000000000= 28,830,581,683,200, discarding the low bit
These bits as a double2.84883999 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime7
Nearest square below57,661,151,128,036
Nearest square above57,661,166,315,025
Powers & multiples
57,661,163,366,400 to the power 23,324,809,760,766,669,380,648,960,000
57,661,163,366,400 to the power 3191712398777768224469616389410… (42 digits)
57,661,163,366,400 to the power 4110543599452893172795374166229… (56 digits)
57,661,163,366,400 to the power 5637407254716315889768129395715… (69 digits)
First ten multiples57,661,163,366,400, 115,322,326,732,800, 172,983,490,099,200, 230,644,653,465,600, 288,305,816,832,000, 345,966,980,198,400, 403,628,143,564,800, 461,289,306,931,200, 518,950,470,297,600, 576,611,633,664,000
Powers of twoBetween 2^45 (35,184,372,088,832) and 2^46 (70,368,744,177,664)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11Yes
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1232the total stopping time
Highest value reached57,661,163,366,400
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps57,661,163,366,400 → 28,830,581,683,200 → 14,415,290,841,600 → 7,207,645,420,800 → 3,603,822,710,400 → 1,801,911,355,200 → 900,955,677,600 → 450,477,838,800 → 225,238,919,400 → 112,619,459,700 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5.76611634 × 10^15%
57,661,163,366,400% as a decimal576,611,633,664
57,661,163,366,400% of 10057,661,163,366,400
57,661,163,366,400% of 1,000576,611,633,664,000
As a fraction of 10057,661,163,366,400/100
Read another way
As seconds1,827,172 years and 3 days
As bytes52.443 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 57,661,163,366,400
Nearby primes
Also reads as
57661163366400 (identifier)
- 14 characters
- Checksum fails
57661163366400 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