Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …101100110110011001101011 |
3 | 122011211120202200102200011211 |
4 | 131302110102230312121223 |
5 | 114132310233434223342 |
6 | 1142341025114133551 |
7 | 36410342441646223 |
oct | 3562242254663153 |
9 | 564746680380154 |
10 | 131001111242347 |
11 | 38817294116a25 |
12 | 12838a871212b7 |
13 | 5813475b39878 |
14 | 244c6b802d083 |
15 | 102298d666c17 |
hex | 772512b3666b |
131001111242347 has 2 divisors, whose sum is σ = 131001111242348. Its totient is φ = 131001111242346.
The previous prime is 131001111242327. The next prime is 131001111242357. The reversal of 131001111242347 is 743242111100131.
It is a strong prime.
It is an emirp because it is prime and its reverse (743242111100131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131001111242347 - 223 = 131001102853739 is a prime.
It is a super-3 number, since 3×1310011112423473 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (131001111242327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500555621173 + 65500555621174.
It is an arithmetic number, because the mean of its divisors is an integer number (65500555621174).
Almost surely, 2131001111242347 is an apocalyptic number.
131001111242347 is a deficient number, since it is larger than the sum of its proper divisors (1).
131001111242347 is an equidigital number, since it uses as much as digits as its factorization.
131001111242347 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 131001111242347 its reverse (743242111100131), we get a palindrome (874243222342478).
The spelling of 131001111242347 in words is "one hundred thirty-one trillion, one billion, one hundred eleven million, two hundred forty-two thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •