Base | Representation |
---|---|
bin | 110100001010110110… |
… | …010111101001011001 |
3 | 12100120220010002201121 |
4 | 310022312113221121 |
5 | 1404210222142031 |
6 | 41422250045241 |
7 | 4022100145402 |
oct | 641266275131 |
9 | 170526102647 |
10 | 56016599641 |
11 | 21835a01452 |
12 | aa33a19821 |
13 | 53893cb262 |
14 | 29d58209a9 |
15 | 16ccbab011 |
hex | d0ad97a59 |
56016599641 has 2 divisors, whose sum is σ = 56016599642. Its totient is φ = 56016599640.
The previous prime is 56016599579. The next prime is 56016599647. The reversal of 56016599641 is 14699561065.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42981582400 + 13035017241 = 207320^2 + 114171^2 .
It is a cyclic number.
It is not a de Polignac number, because 56016599641 - 235 = 21656861273 is a prime.
It is not a weakly prime, because it can be changed into another prime (56016599647) 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 as a sum of consecutive naturals, namely, 28008299820 + 28008299821.
It is an arithmetic number, because the mean of its divisors is an integer number (28008299821).
Almost surely, 256016599641 is an apocalyptic number.
It is an amenable number.
56016599641 is a deficient number, since it is larger than the sum of its proper divisors (1).
56016599641 is an equidigital number, since it uses as much as digits as its factorization.
56016599641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 52.
The spelling of 56016599641 in words is "fifty-six billion, sixteen million, five hundred ninety-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •