Base | Representation |
---|---|
bin | 10111001111101011001010… |
… | …101000111101000110000111 |
3 | 111101222022012120201022022221 |
4 | 113033223022220331012013 |
5 | 101344433032044004111 |
6 | 1001232455102033211 |
7 | 30351014333221042 |
oct | 2717531250750607 |
9 | 441868176638287 |
10 | 102232211313031 |
11 | 2a63548a109418 |
12 | b571354878807 |
13 | 45075c1254307 |
14 | 1b360cb771c59 |
15 | bc4463a4e371 |
hex | 5cfacaa3d187 |
102232211313031 has 2 divisors, whose sum is σ = 102232211313032. Its totient is φ = 102232211313030.
The previous prime is 102232211312989. The next prime is 102232211313059. The reversal of 102232211313031 is 130313112232201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102232211313031 - 29 = 102232211312519 is a prime.
It is a super-2 number, since 2×1022322113130312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102232211312987 and 102232211313005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102232211313131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116105656515 + 51116105656516.
It is an arithmetic number, because the mean of its divisors is an integer number (51116105656516).
Almost surely, 2102232211313031 is an apocalyptic number.
102232211313031 is a deficient number, since it is larger than the sum of its proper divisors (1).
102232211313031 is an equidigital number, since it uses as much as digits as its factorization.
102232211313031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 102232211313031 its reverse (130313112232201), we get a palindrome (232545323545232).
The spelling of 102232211313031 in words is "one hundred two trillion, two hundred thirty-two billion, two hundred eleven million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •