Base | Representation |
---|---|
bin | 11101110010010100011110… |
… | …101010110011000110000111 |
3 | 122011211121021200020210120201 |
4 | 131302110132222303012013 |
5 | 114132311141334443421 |
6 | 1142341101045511331 |
7 | 36410350430430214 |
oct | 3562243652630607 |
9 | 564747250223521 |
10 | 131001312031111 |
11 | 38817387498555 |
12 | 12838b22412547 |
13 | 58134a860bba2 |
14 | 244c6d6978b0b |
15 | 10229a10c9b91 |
hex | 77251eab3187 |
131001312031111 has 2 divisors, whose sum is σ = 131001312031112. Its totient is φ = 131001312031110.
The previous prime is 131001312031099. The next prime is 131001312031141. The reversal of 131001312031111 is 111130213100131.
It is a weak prime.
It is an emirp because it is prime and its reverse (111130213100131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131001312031111 - 233 = 130992722096519 is a prime.
It is a super-2 number, since 2×1310013120311112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131001312031141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500656015555 + 65500656015556.
It is an arithmetic number, because the mean of its divisors is an integer number (65500656015556).
Almost surely, 2131001312031111 is an apocalyptic number.
131001312031111 is a deficient number, since it is larger than the sum of its proper divisors (1).
131001312031111 is an equidigital number, since it uses as much as digits as its factorization.
131001312031111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 131001312031111 its reverse (111130213100131), we get a palindrome (242131525131242).
The spelling of 131001312031111 in words is "one hundred thirty-one trillion, one billion, three hundred twelve million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •