Base | Representation |
---|---|
bin | 11001011111110101001111… |
… | …11010111010111111101101 |
3 | 21100112011201100010002102102 |
4 | 30233322213322322333231 |
5 | 24322114432000314203 |
6 | 315125520135304445 |
7 | 14544606012103442 |
oct | 1457724772727755 |
9 | 240464640102372 |
10 | 56069320323053 |
11 | 16957957664224 |
12 | 6356739b1b125 |
13 | 25394114554bb |
14 | dbbaaba459c9 |
15 | 6737596ec888 |
hex | 32fea7ebafed |
56069320323053 has 2 divisors, whose sum is σ = 56069320323054. Its totient is φ = 56069320323052.
The previous prime is 56069320323019. The next prime is 56069320323059. The reversal of 56069320323053 is 35032302396065.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45089653703689 + 10979666619364 = 6714883^2 + 3313558^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56069320323053 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56069320322989 and 56069320323007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56069320323059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28034660161526 + 28034660161527.
It is an arithmetic number, because the mean of its divisors is an integer number (28034660161527).
Almost surely, 256069320323053 is an apocalyptic number.
It is an amenable number.
56069320323053 is a deficient number, since it is larger than the sum of its proper divisors (1).
56069320323053 is an equidigital number, since it uses as much as digits as its factorization.
56069320323053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2624400, while the sum is 47.
The spelling of 56069320323053 in words is "fifty-six trillion, sixty-nine billion, three hundred twenty million, three hundred twenty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.802 sec. • engine limits •