Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111110011100000101 |
3 | 100200020111200220112122 |
4 | 1132100211332130011 |
5 | 3124234242400424 |
6 | 114254552055325 |
7 | 10212036561644 |
oct | 1362045763405 |
9 | 320214626478 |
10 | 101210121989 |
11 | 39a17525719 |
12 | 17747094545 |
13 | 970c439162 |
14 | 4c81a6735b |
15 | 29755c445e |
hex | 179097e705 |
101210121989 has 2 divisors, whose sum is σ = 101210121990. Its totient is φ = 101210121988.
The previous prime is 101210121983. The next prime is 101210122007. The reversal of 101210121989 is 989121012101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100901522500 + 308599489 = 317650^2 + 17567^2 .
It is an emirp because it is prime and its reverse (989121012101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101210121989 - 228 = 100941686533 is a prime.
It is a super-2 number, since 2×1012101219892 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101210121983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605060994 + 50605060995.
It is an arithmetic number, because the mean of its divisors is an integer number (50605060995).
Almost surely, 2101210121989 is an apocalyptic number.
It is an amenable number.
101210121989 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210121989 is an equidigital number, since it uses as much as digits as its factorization.
101210121989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 35.
The spelling of 101210121989 in words is "one hundred one billion, two hundred ten million, one hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •