Base | Representation |
---|---|
bin | 11001011111101010111101… |
… | …10101001101101101110001 |
3 | 21100111122110120000001112012 |
4 | 30233311132311031231301 |
5 | 24322022130033412201 |
6 | 315123204225012305 |
7 | 14544322130503631 |
oct | 1457653665155561 |
9 | 240448416001465 |
10 | 56063799122801 |
11 | 1695558402a808 |
12 | 6355658a84095 |
13 | 2538a4162acc2 |
14 | dbb7066706c1 |
15 | 673534b415bb |
hex | 32fd5ed4db71 |
56063799122801 has 2 divisors, whose sum is σ = 56063799122802. Its totient is φ = 56063799122800.
The previous prime is 56063799122759. The next prime is 56063799122803. The reversal of 56063799122801 is 10822199736065.
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., 28119677234401 + 27944121888400 = 5302799^2 + 5286220^2 .
It is a cyclic number.
It is not a de Polignac number, because 56063799122801 - 210 = 56063799121777 is a prime.
Together with 56063799122803, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56063799122803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28031899561400 + 28031899561401.
It is an arithmetic number, because the mean of its divisors is an integer number (28031899561401).
Almost surely, 256063799122801 is an apocalyptic number.
It is an amenable number.
56063799122801 is a deficient number, since it is larger than the sum of its proper divisors (1).
56063799122801 is an equidigital number, since it uses as much as digits as its factorization.
56063799122801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9797760, while the sum is 59.
The spelling of 56063799122801 in words is "fifty-six trillion, sixty-three billion, seven hundred ninety-nine million, one hundred twenty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •