Base | Representation |
---|---|
bin | 11001110000000010111100… |
… | …11100111001000110000001 |
3 | 21102111102201111202220102202 |
4 | 30320001132130321012001 |
5 | 24410231413431301112 |
6 | 320233454023322545 |
7 | 14633060544464162 |
oct | 1470013634710601 |
9 | 242442644686382 |
10 | 56626433462657 |
11 | 17052154494843 |
12 | 64266b9bb0455 |
13 | 2579b07c10326 |
14 | ddaa3c167769 |
15 | 682eb43dc6c2 |
hex | 33805e739181 |
56626433462657 has 2 divisors, whose sum is σ = 56626433462658. Its totient is φ = 56626433462656.
The previous prime is 56626433462653. The next prime is 56626433462659. The reversal of 56626433462657 is 75626433462665.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56015509891201 + 610923571456 = 7484351^2 + 781616^2 .
It is a cyclic number.
It is not a de Polignac number, because 56626433462657 - 22 = 56626433462653 is a prime.
Together with 56626433462659, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 56626433462593 and 56626433462602.
It is not a weakly prime, because it can be changed into another prime (56626433462653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28313216731328 + 28313216731329.
It is an arithmetic number, because the mean of its divisors is an integer number (28313216731329).
Almost surely, 256626433462657 is an apocalyptic number.
It is an amenable number.
56626433462657 is a deficient number, since it is larger than the sum of its proper divisors (1).
56626433462657 is an equidigital number, since it uses as much as digits as its factorization.
56626433462657 is an evil number, because the sum of its binary digits is even.
The product of its digits is 783820800, while the sum is 65.
The spelling of 56626433462657 in words is "fifty-six trillion, six hundred twenty-six billion, four hundred thirty-three million, four hundred sixty-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •