Base | Representation |
---|---|
bin | 10111001101111001011100… |
… | …011010110111000000011111 |
3 | 111101112122000122110022222022 |
4 | 113031321130122313000133 |
5 | 101340432442334240111 |
6 | 1001100422254010355 |
7 | 30336132354064112 |
oct | 2715713432670037 |
9 | 441478018408868 |
10 | 102110103040031 |
11 | 2a598719185619 |
12 | b551756aa69bb |
13 | 44c8c31343638 |
14 | 1b30226428579 |
15 | bc11b894a2db |
hex | 5cde5c6b701f |
102110103040031 has 2 divisors, whose sum is σ = 102110103040032. Its totient is φ = 102110103040030.
The previous prime is 102110103039991. The next prime is 102110103040051. The reversal of 102110103040031 is 130040301011201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102110103040031 is a prime.
It is a super-2 number, since 2×1021101030400312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102110103039991 and 102110103040009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102110103040051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055051520015 + 51055051520016.
It is an arithmetic number, because the mean of its divisors is an integer number (51055051520016).
Almost surely, 2102110103040031 is an apocalyptic number.
102110103040031 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110103040031 is an equidigital number, since it uses as much as digits as its factorization.
102110103040031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102110103040031 its reverse (130040301011201), we get a palindrome (232150404051232).
The spelling of 102110103040031 in words is "one hundred two trillion, one hundred ten billion, one hundred three million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •