Base | Representation |
---|---|
bin | 110100001011101110… |
… | …010000101010011100 |
3 | 12100121220200110202020 |
4 | 310023232100222130 |
5 | 1404223000013400 |
6 | 41423532100140 |
7 | 4022335530126 |
oct | 641356205234 |
9 | 170556613666 |
10 | 56031251100 |
11 | 218431a92a0 |
12 | aa38904650 |
13 | 538c45b066 |
14 | 29d7756216 |
15 | 16ce1022a0 |
hex | d0bb90a9c |
56031251100 has 144 divisors (see below), whose sum is σ = 179754911616. Its totient is φ = 13360608000.
The previous prime is 56031251057. The next prime is 56031251149. The reversal of 56031251100 is 115213065.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 62127 + ... + 340473.
Almost surely, 256031251100 is an apocalyptic number.
56031251100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56031251100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89877455808).
56031251100 is an abundant number, since it is smaller than the sum of its proper divisors (123723660516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56031251100 is a wasteful number, since it uses less digits than its factorization.
56031251100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278436 (or 278429 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 56031251100 its reverse (115213065), we get a palindrome (56146464165).
The spelling of 56031251100 in words is "fifty-six billion, thirty-one million, two hundred fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •