Base | Representation |
---|---|
bin | 11001011111011100011100… |
… | …10101001110111101111100 |
3 | 21100110220100110002001012012 |
4 | 30233232032111032331330 |
5 | 24321410200031023400 |
6 | 315115435041430352 |
7 | 14543625042135122 |
oct | 1457561625167574 |
9 | 240426313061165 |
10 | 56056006111100 |
11 | 16952245088776 |
12 | 635404303b3b8 |
13 | 253809bc4ac88 |
14 | dbb1a7687912 |
15 | 67322a8d0d35 |
hex | 32fb8e54ef7c |
56056006111100 has 36 divisors (see below), whose sum is σ = 121670489548608. Its totient is φ = 22417064880000.
The previous prime is 56056006111099. The next prime is 56056006111117. The reversal of 56056006111100 is 111160065065.
It is a super-2 number, since 2×560560061111002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66297356 + ... + 67137555.
Almost surely, 256056006111100 is an apocalyptic number.
56056006111100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56056006111100 is an abundant number, since it is smaller than the sum of its proper divisors (65614483437508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56056006111100 is a wasteful number, since it uses less digits than its factorization.
56056006111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133439126 (or 133439119 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 56056006111100 its reverse (111160065065), we get a palindrome (56167166176165).
The spelling of 56056006111100 in words is "fifty-six trillion, fifty-six billion, six million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •