Base | Representation |
---|---|
bin | 1110001111000001001000… |
… | …11001011110101001000011 |
3 | 11002211110210100200221111001 |
4 | 13013200210121132221003 |
5 | 13100324134032442011 |
6 | 150324032024232431 |
7 | 6410342655400456 |
oct | 707404431365103 |
9 | 132743710627431 |
10 | 31302332312131 |
11 | 9a792765a3931 |
12 | 361672790b717 |
13 | 1460a497b302a |
14 | 7a30805b549d |
15 | 3943a38547c1 |
hex | 1c782465ea43 |
31302332312131 has 2 divisors, whose sum is σ = 31302332312132. Its totient is φ = 31302332312130.
The previous prime is 31302332312117. The next prime is 31302332312297. The reversal of 31302332312131 is 13121323320313.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 31302332312131 - 29 = 31302332311619 is a prime.
It is a super-2 number, since 2×313023323121312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31302332312131.
It is not a weakly prime, because it can be changed into another prime (31302332312101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15651166156065 + 15651166156066.
It is an arithmetic number, because the mean of its divisors is an integer number (15651166156066).
Almost surely, 231302332312131 is an apocalyptic number.
31302332312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31302332312131 is an equidigital number, since it uses as much as digits as its factorization.
31302332312131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 31302332312131 its reverse (13121323320313), we get a palindrome (44423655632444).
The spelling of 31302332312131 in words is "thirty-one trillion, three hundred two billion, three hundred thirty-two million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •