Base | Representation |
---|---|
bin | 10111001101111010011000… |
… | …011100111010100110010101 |
3 | 111101112201121211121222011102 |
4 | 113031322120130322212111 |
5 | 101340442023203240424 |
6 | 1001101110233115445 |
7 | 30336166333645364 |
oct | 2715723034724625 |
9 | 441481554558142 |
10 | 102111110211989 |
11 | 2a59909575783a |
12 | b551998258b85 |
13 | 44c9061bc2088 |
14 | 1b302c00c17db |
15 | bc12270967ae |
hex | 5cde9873a995 |
102111110211989 has 2 divisors, whose sum is σ = 102111110211990. Its totient is φ = 102111110211988.
The previous prime is 102111110211973. The next prime is 102111110212009. The reversal of 102111110211989 is 989112011111201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69173037923089 + 32938072288900 = 8317033^2 + 5739170^2 .
It is a cyclic number.
It is not a de Polignac number, because 102111110211989 - 24 = 102111110211973 is a prime.
It is a super-2 number, since 2×1021111102119892 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102111112211989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055555105994 + 51055555105995.
It is an arithmetic number, because the mean of its divisors is an integer number (51055555105995).
Almost surely, 2102111110211989 is an apocalyptic number.
It is an amenable number.
102111110211989 is a deficient number, since it is larger than the sum of its proper divisors (1).
102111110211989 is an equidigital number, since it uses as much as digits as its factorization.
102111110211989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 38.
The spelling of 102111110211989 in words is "one hundred two trillion, one hundred eleven billion, one hundred ten million, two hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •