Base | Representation |
---|---|
bin | 110100001101110111… |
… | …001110100010000100 |
3 | 12100201102020122011001 |
4 | 310031313032202010 |
5 | 1404311142443400 |
6 | 41431253423044 |
7 | 4023252651334 |
oct | 641567164204 |
9 | 170642218131 |
10 | 56067156100 |
11 | 218614a224a |
12 | aa4893aa84 |
13 | 5396a1ca17 |
14 | 29dc4210c4 |
15 | 16d2345a6a |
hex | d0ddce884 |
56067156100 has 36 divisors (see below), whose sum is σ = 121773738100. Its totient is φ = 22406952960.
The previous prime is 56067156083. The next prime is 56067156113. The reversal of 56067156100 is 165176065.
It can be written as a sum of positive squares in 6 ways, for example, as 6670315584 + 49396840516 = 81672^2 + 222254^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 56067156100.
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 11 ways as a sum of consecutive naturals, for example, 135405 + ... + 361204.
Almost surely, 256067156100 is an apocalyptic number.
56067156100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56067156100 is an abundant number, since it is smaller than the sum of its proper divisors (65706582000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56067156100 is a wasteful number, since it uses less digits than its factorization.
56067156100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497752 (or 497745 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 37.
The spelling of 56067156100 in words is "fifty-six billion, sixty-seven million, one hundred fifty-six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •