Base | Representation |
---|---|
bin | 1001001111001010011101… |
… | …10010100100001111110001 |
3 | 2122220211101200122201001201 |
4 | 10213211032302210033301 |
5 | 10130243412342040142 |
6 | 111111150035531201 |
7 | 4164336542065426 |
oct | 447451662441761 |
9 | 78824350581051 |
10 | 20312222221297 |
11 | 65214019a6076 |
12 | 234078a159b01 |
13 | b44585311946 |
14 | 50318c705d4d |
15 | 25357a55dab7 |
hex | 12794eca43f1 |
20312222221297 has 2 divisors, whose sum is σ = 20312222221298. Its totient is φ = 20312222221296.
The previous prime is 20312222221231. The next prime is 20312222221307. The reversal of 20312222221297 is 79212222221302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19039294467216 + 1272927754081 = 4363404^2 + 1128241^2 .
It is a cyclic number.
It is not a de Polignac number, because 20312222221297 - 211 = 20312222219249 is a prime.
It is not a weakly prime, because it can be changed into another prime (20312222221397) 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, 10156111110648 + 10156111110649.
It is an arithmetic number, because the mean of its divisors is an integer number (10156111110649).
Almost surely, 220312222221297 is an apocalyptic number.
It is an amenable number.
20312222221297 is a deficient number, since it is larger than the sum of its proper divisors (1).
20312222221297 is an equidigital number, since it uses as much as digits as its factorization.
20312222221297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 37.
Adding to 20312222221297 its reverse (79212222221302), we get a palindrome (99524444442599).
The spelling of 20312222221297 in words is "twenty trillion, three hundred twelve billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •