Base | Representation |
---|---|
bin | 110100010111011100… |
… | …000100111100111010 |
3 | 12101010121112202102100 |
4 | 310113130010330322 |
5 | 1410123304424010 |
6 | 41455233044230 |
7 | 4030243336341 |
oct | 642734047472 |
9 | 171117482370 |
10 | 56227811130 |
11 | 219341517a7 |
12 | aa926b6676 |
13 | 53c10ac67a |
14 | 2a158c0b58 |
15 | 16e14cc2c0 |
hex | d17704f3a |
56227811130 has 48 divisors (see below), whose sum is σ = 146206012680. Its totient is φ = 14992677504.
The previous prime is 56227811113. The next prime is 56227811147. The reversal of 56227811130 is 3111872265.
56227811130 is a `hidden beast` number, since 5 + 622 + 7 + 8 + 11 + 13 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (56227811113) and next prime (56227811147).
It can be written as a sum of positive squares in 4 ways, for example, as 30708707121 + 25519104009 = 175239^2 + 159747^2 .
It is a super-3 number, since 3×562278111303 (a number of 33 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1240344 + ... + 1284876.
Almost surely, 256227811130 is an apocalyptic number.
56227811130 is an abundant number, since it is smaller than the sum of its proper divisors (89978201550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56227811130 is a wasteful number, since it uses less digits than its factorization.
56227811130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58575 (or 58572 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The spelling of 56227811130 in words is "fifty-six billion, two hundred twenty-seven million, eight hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •