Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …1011111000011000010101 |
3 | 1022202122110211122220010021 |
4 | 2102333103023320120111 |
5 | 2310443332333014424 |
6 | 33252201314025141 |
7 | 2061526321504114 |
oct | 222772313703025 |
9 | 38678424586107 |
10 | 10101011219989 |
11 | 32448a6556718 |
12 | 11717882781b1 |
13 | 5836a1303091 |
14 | 26cc6a5bbc7b |
15 | 127b3cd284e4 |
hex | 92fd32f8615 |
10101011219989 has 2 divisors, whose sum is σ = 10101011219990. Its totient is φ = 10101011219988.
The previous prime is 10101011219983. The next prime is 10101011220061. The reversal of 10101011219989 is 98991211010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5476339464964 + 4624671755025 = 2340158^2 + 2150505^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101011219989 - 27 = 10101011219861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101011219983) 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, 5050505609994 + 5050505609995.
It is an arithmetic number, because the mean of its divisors is an integer number (5050505609995).
Almost surely, 210101011219989 is an apocalyptic number.
It is an amenable number.
10101011219989 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101011219989 is an equidigital number, since it uses as much as digits as its factorization.
10101011219989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 43.
It can be divided in two parts, 101010112 and 19989, that added together give a palindrome (101030101).
The spelling of 10101011219989 in words is "ten trillion, one hundred one billion, eleven million, two hundred nineteen thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •