Base | Representation |
---|---|
bin | 11101111011000011010… |
… | …001010011110001110101 |
3 | 21021120121000122111110211 |
4 | 131323003101103301311 |
5 | 232142220214241234 |
6 | 4212345420145421 |
7 | 301363204353235 |
oct | 35730321236165 |
9 | 7246530574424 |
10 | 2056270462069 |
11 | 72307208389a |
12 | 292628998271 |
13 | 11bba0428085 |
14 | 71749cb3cc5 |
15 | 3874d0d2164 |
hex | 1dec3453c75 |
2056270462069 has 2 divisors, whose sum is σ = 2056270462070. Its totient is φ = 2056270462068.
The previous prime is 2056270461997. The next prime is 2056270462073. The reversal of 2056270462069 is 9602640726502.
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., 2027391538225 + 28878923844 = 1423865^2 + 169938^2 .
It is a cyclic number.
It is not a de Polignac number, because 2056270462069 - 213 = 2056270453877 is a prime.
It is a super-2 number, since 2×20562704620692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2056270462079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1028135231034 + 1028135231035.
It is an arithmetic number, because the mean of its divisors is an integer number (1028135231035).
Almost surely, 22056270462069 is an apocalyptic number.
It is an amenable number.
2056270462069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2056270462069 is an equidigital number, since it uses as much as digits as its factorization.
2056270462069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 2056270462069 in words is "two trillion, fifty-six billion, two hundred seventy million, four hundred sixty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •