Base | Representation |
---|---|
bin | 101111001110111000… |
… | …1110000011111000011 |
3 | 100200210220220122110002 |
4 | 1132131301300133003 |
5 | 3130212404024441 |
6 | 114332533030215 |
7 | 10220363642462 |
oct | 1363561603703 |
9 | 320726818402 |
10 | 101431314371 |
11 | 3a020372842 |
12 | 177a918536b |
13 | 974620351a |
14 | 4ca31a49d9 |
15 | 2989c17b9b |
hex | 179dc707c3 |
101431314371 has 2 divisors, whose sum is σ = 101431314372. Its totient is φ = 101431314370.
The previous prime is 101431314253. The next prime is 101431314421. The reversal of 101431314371 is 173413134101.
It is a strong prime.
It is an emirp because it is prime and its reverse (173413134101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101431314371 is a prime.
It is a super-2 number, since 2×1014313143712 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101431394371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50715657185 + 50715657186.
It is an arithmetic number, because the mean of its divisors is an integer number (50715657186).
Almost surely, 2101431314371 is an apocalyptic number.
101431314371 is a deficient number, since it is larger than the sum of its proper divisors (1).
101431314371 is an equidigital number, since it uses as much as digits as its factorization.
101431314371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 101431314371 its reverse (173413134101), we get a palindrome (274844448472).
The spelling of 101431314371 in words is "one hundred one billion, four hundred thirty-one million, three hundred fourteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •