Base | Representation |
---|---|
bin | 110100001101011011… |
… | …111100101010101011 |
3 | 12100200220210022201210 |
4 | 310031123330222223 |
5 | 1404302330130120 |
6 | 41430440244203 |
7 | 4023135115626 |
oct | 641533745253 |
9 | 170626708653 |
10 | 56060005035 |
11 | 21858458581 |
12 | aa46470663 |
13 | 53953b7b18 |
14 | 29db4bcdbd |
15 | 16d18d1ce0 |
hex | d0d6fcaab |
56060005035 has 16 divisors (see below), whose sum is σ = 94972244256. Its totient is φ = 28139923968.
The previous prime is 56060005019. The next prime is 56060005049. The reversal of 56060005035 is 53050006065.
It is not a de Polignac number, because 56060005035 - 24 = 56060005019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56060004993 and 56060005011.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109921324 + ... + 109921833.
It is an arithmetic number, because the mean of its divisors is an integer number (5935765266).
Almost surely, 256060005035 is an apocalyptic number.
56060005035 is a deficient number, since it is larger than the sum of its proper divisors (38912239221).
56060005035 is a wasteful number, since it uses less digits than its factorization.
56060005035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219843182.
The product of its (nonzero) digits is 13500, while the sum is 30.
The spelling of 56060005035 in words is "fifty-six billion, sixty million, five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •