Base | Representation |
---|---|
bin | 1110001110111111000101… |
… | …10000010011101001000001 |
3 | 11002211100221121101111102122 |
4 | 13013133202300103221001 |
5 | 13100314410114001004 |
6 | 150323330443254025 |
7 | 6410303453401346 |
oct | 707374260235101 |
9 | 132740847344378 |
10 | 31301231000129 |
11 | 9a78860972922 |
12 | 361647ab1a315 |
13 | 146090259311c |
14 | 7a2db82147cd |
15 | 39433bd0ecbe |
hex | 1c77e2c13a41 |
31301231000129 has 2 divisors, whose sum is σ = 31301231000130. Its totient is φ = 31301231000128.
The previous prime is 31301231000111. The next prime is 31301231000131. The reversal of 31301231000129 is 92100013210313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29255550145600 + 2045680854529 = 5408840^2 + 1430273^2 .
It is a cyclic number.
It is not a de Polignac number, because 31301231000129 - 220 = 31301229951553 is a prime.
Together with 31301231000131, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 31301231000098 and 31301231000107.
It is not a weakly prime, because it can be changed into another prime (31301231008129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15650615500064 + 15650615500065.
It is an arithmetic number, because the mean of its divisors is an integer number (15650615500065).
Almost surely, 231301231000129 is an apocalyptic number.
It is an amenable number.
31301231000129 is a deficient number, since it is larger than the sum of its proper divisors (1).
31301231000129 is an equidigital number, since it uses as much as digits as its factorization.
31301231000129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 31301231000129 in words is "thirty-one trillion, three hundred one billion, two hundred thirty-one million, one hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •