Base | Representation |
---|---|
bin | 1110001101001111010101… |
… | …00110111010101100000001 |
3 | 11002121122002020222011211101 |
4 | 13012213222212322230001 |
5 | 13043324021200323314 |
6 | 150240005134414401 |
7 | 6403050611544604 |
oct | 706475246725401 |
9 | 132548066864741 |
10 | 31241233214209 |
11 | 9a55372768287 |
12 | 3606915961401 |
13 | 145806042c955 |
14 | 7a0125b7a33b |
15 | 3929c9898174 |
hex | 1c69ea9bab01 |
31241233214209 has 2 divisors, whose sum is σ = 31241233214210. Its totient is φ = 31241233214208.
The previous prime is 31241233214203. The next prime is 31241233214239. The reversal of 31241233214209 is 90241233214213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29210209194609 + 2031024019600 = 5404647^2 + 1425140^2 .
It is an emirp because it is prime and its reverse (90241233214213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31241233214209 - 213 = 31241233206017 is a prime.
It is not a weakly prime, because it can be changed into another prime (31241233214203) 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, 15620616607104 + 15620616607105.
It is an arithmetic number, because the mean of its divisors is an integer number (15620616607105).
Almost surely, 231241233214209 is an apocalyptic number.
It is an amenable number.
31241233214209 is a deficient number, since it is larger than the sum of its proper divisors (1).
31241233214209 is an equidigital number, since it uses as much as digits as its factorization.
31241233214209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 31241233214209 in words is "thirty-one trillion, two hundred forty-one billion, two hundred thirty-three million, two hundred fourteen thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •