Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …1101111111111101110101 |
3 | 1022202120011000212011200202 |
4 | 2102332131131333331311 |
5 | 2310440011124444424 |
6 | 33251532041450245 |
7 | 2061465066324422 |
oct | 222763535777565 |
9 | 38676130764622 |
10 | 10100109999989 |
11 | 32444838707a9 |
12 | 11715764a0985 |
13 | 5835896a02c9 |
14 | 26cbc2a24d49 |
15 | 127ad8b5a2ae |
hex | 92f9d77ff75 |
10100109999989 has 2 divisors, whose sum is σ = 10100109999990. Its totient is φ = 10100109999988.
The previous prime is 10100109999961. The next prime is 10100110000037. The reversal of 10100109999989 is 98999990100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9492918399364 + 607191600625 = 3081058^2 + 779225^2 .
It is an emirp because it is prime and its reverse (98999990100101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10100109999989 - 212 = 10100109995893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100109999919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050054999994 + 5050054999995.
It is an arithmetic number, because the mean of its divisors is an integer number (5050054999995).
Almost surely, 210100109999989 is an apocalyptic number.
It is an amenable number.
10100109999989 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100109999989 is an equidigital number, since it uses as much as digits as its factorization.
10100109999989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4251528, while the sum is 65.
The spelling of 10100109999989 in words is "ten trillion, one hundred billion, one hundred nine million, nine hundred ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •