Base | Representation |
---|---|
bin | 11001011111101111010101… |
… | …11111001111001011100101 |
3 | 21100111212112102122110121210 |
4 | 30233313222333033023211 |
5 | 24322041434020413420 |
6 | 315124233424302033 |
7 | 14544434322421242 |
oct | 1457675277171345 |
9 | 240455472573553 |
10 | 56066150560485 |
11 | 1695658039373a |
12 | 6355bb4471919 |
13 | 2539027842a50 |
14 | dbb88aa8c5c9 |
15 | 6736212c39e0 |
hex | 32fdeafcf2e5 |
56066150560485 has 64 divisors (see below), whose sum is σ = 97316157818880. Its totient is φ = 27399518127360.
The previous prime is 56066150560429. The next prime is 56066150560487. The reversal of 56066150560485 is 58406505166065.
It is not a de Polignac number, because 56066150560485 - 229 = 56065613689573 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56066150560487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18524232 + ... + 21337278.
It is an arithmetic number, because the mean of its divisors is an integer number (1520564965920).
Almost surely, 256066150560485 is an apocalyptic number.
It is an amenable number.
56066150560485 is a deficient number, since it is larger than the sum of its proper divisors (41250007258395).
56066150560485 is a wasteful number, since it uses less digits than its factorization.
56066150560485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2813818.
The product of its (nonzero) digits is 25920000, while the sum is 57.
The spelling of 56066150560485 in words is "fifty-six trillion, sixty-six billion, one hundred fifty million, five hundred sixty thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •