Base | Representation |
---|---|
bin | 1110010011000110000100… |
… | …11010110101110110000001 |
3 | 11010022212101110221220222121 |
4 | 13021203002122311312001 |
5 | 13110123040120013123 |
6 | 150512241025404241 |
7 | 6423432352603435 |
oct | 711430232656601 |
9 | 133285343856877 |
10 | 31442422422913 |
11 | a022724834597 |
12 | 3639903799681 |
13 | 1471013c354c8 |
14 | 7a9b6db7c9c5 |
15 | 397d5242575d |
hex | 1c98c26b5d81 |
31442422422913 has 2 divisors, whose sum is σ = 31442422422914. Its totient is φ = 31442422422912.
The previous prime is 31442422422871. The next prime is 31442422422967. The reversal of 31442422422913 is 31922422424413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26417615997249 + 5024806425664 = 5139807^2 + 2241608^2 .
It is an emirp because it is prime and its reverse (31922422424413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31442422422913 - 221 = 31442420325761 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31442422422913.
It is not a weakly prime, because it can be changed into another prime (31442422402913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15721211211456 + 15721211211457.
It is an arithmetic number, because the mean of its divisors is an integer number (15721211211457).
Almost surely, 231442422422913 is an apocalyptic number.
It is an amenable number.
31442422422913 is a deficient number, since it is larger than the sum of its proper divisors (1).
31442422422913 is an equidigital number, since it uses as much as digits as its factorization.
31442422422913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 663552, while the sum is 43.
The spelling of 31442422422913 in words is "thirty-one trillion, four hundred forty-two billion, four hundred twenty-two million, four hundred twenty-two thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •