Base | Representation |
---|---|
bin | 110100001110001010… |
… | …011110001101011011 |
3 | 12100201202201221112002 |
4 | 310032022132031123 |
5 | 1404313440413201 |
6 | 41431553511215 |
7 | 4023343562546 |
oct | 641612361533 |
9 | 170652657462 |
10 | 56072201051 |
11 | 21864328629 |
12 | aa4a57250b |
13 | 5397a980b9 |
14 | 29dcd7585d |
15 | 16d29e076b |
hex | d0e29e35b |
56072201051 has 8 divisors (see below), whose sum is σ = 57144709440. Its totient is φ = 55003763848.
The previous prime is 56072200999. The next prime is 56072201083. The reversal of 56072201051 is 15010227065.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56072201051 - 230 = 54998459227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56072261051) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 989981 + ... + 1045086.
It is an arithmetic number, because the mean of its divisors is an integer number (7143088680).
Almost surely, 256072201051 is an apocalyptic number.
56072201051 is a deficient number, since it is larger than the sum of its proper divisors (1072508389).
56072201051 is a wasteful number, since it uses less digits than its factorization.
56072201051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035593.
The product of its (nonzero) digits is 4200, while the sum is 29.
The spelling of 56072201051 in words is "fifty-six billion, seventy-two million, two hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •