Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011110100010010111 |
3 | 10122110212121020101001122 |
4 | 32333112320132202113 |
5 | 113334122143004421 |
6 | 2105120015314155 |
7 | 134264616122564 |
oct | 16772670364227 |
9 | 3573777211048 |
10 | 1030102313111 |
11 | 3679559a0313 |
12 | 14778321b95b |
13 | 761a4904231 |
14 | 37c002c586b |
15 | 1bbde3502ab |
hex | efd6e1e897 |
1030102313111 has 2 divisors, whose sum is σ = 1030102313112. Its totient is φ = 1030102313110.
The previous prime is 1030102313099. The next prime is 1030102313113. The reversal of 1030102313111 is 1113132010301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030102313111 is a prime.
It is a super-2 number, since 2×10301023131112 (a number of 25 digits) contains 22 as substring.
Together with 1030102313113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1030102313111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030102313113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515051156555 + 515051156556.
It is an arithmetic number, because the mean of its divisors is an integer number (515051156556).
Almost surely, 21030102313111 is an apocalyptic number.
1030102313111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030102313111 is an equidigital number, since it uses as much as digits as its factorization.
1030102313111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1030102313111 its reverse (1113132010301), we get a palindrome (2143234323412).
The spelling of 1030102313111 in words is "one trillion, thirty billion, one hundred two million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •