Base | Representation |
---|---|
bin | 101111100011001101… |
… | …0101011101101000011 |
3 | 100202120102212112111002 |
4 | 1133012122223231003 |
5 | 3133111430200311 |
6 | 114524330442215 |
7 | 10243313203151 |
oct | 1370632535503 |
9 | 322512775432 |
10 | 102113131331 |
11 | 3a340222a32 |
12 | 1795959336b |
13 | 9824547503 |
14 | 4d299683d1 |
15 | 29c99e793b |
hex | 17c66abb43 |
102113131331 has 2 divisors, whose sum is σ = 102113131332. Its totient is φ = 102113131330.
The previous prime is 102113131319. The next prime is 102113131333. The reversal of 102113131331 is 133131311201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102113131331 - 222 = 102108937027 is a prime.
It is a super-2 number, since 2×1021131313312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 102113131333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102113131333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056565665 + 51056565666.
It is an arithmetic number, because the mean of its divisors is an integer number (51056565666).
Almost surely, 2102113131331 is an apocalyptic number.
102113131331 is a deficient number, since it is larger than the sum of its proper divisors (1).
102113131331 is an equidigital number, since it uses as much as digits as its factorization.
102113131331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 102113131331 its reverse (133131311201), we get a palindrome (235244442532).
The spelling of 102113131331 in words is "one hundred two billion, one hundred thirteen million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •