Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …11101011010110000101 |
3 | 10120120021101001112201012 |
4 | 32230233103223112011 |
5 | 113022201404030424 |
6 | 2052012200212005 |
7 | 132656330564645 |
oct | 16545723532605 |
9 | 3516241045635 |
10 | 1010111001989 |
11 | 35a427366391 |
12 | 14392416a005 |
13 | 74339c7c45b |
14 | 36c65222525 |
15 | 1b41e24db0e |
hex | eb2f4eb585 |
1010111001989 has 2 divisors, whose sum is σ = 1010111001990. Its totient is φ = 1010111001988.
The previous prime is 1010111001901. The next prime is 1010111002039. The reversal of 1010111001989 is 9891001110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 764549128225 + 245561873764 = 874385^2 + 495542^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010111001989 - 28 = 1010111001733 is a prime.
It is a super-2 number, since 2×10101110019892 (a number of 25 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 (1010111001089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505055500994 + 505055500995.
It is an arithmetic number, because the mean of its divisors is an integer number (505055500995).
Almost surely, 21010111001989 is an apocalyptic number.
It is an amenable number.
1010111001989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010111001989 is an equidigital number, since it uses as much as digits as its factorization.
1010111001989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 32.
The spelling of 1010111001989 in words is "one trillion, ten billion, one hundred eleven million, one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •