Base | Representation |
---|---|
bin | 1001001100011111011110… |
… | …0010101000110101101001 |
3 | 1022210112012222212012222022 |
4 | 2103013313202220311221 |
5 | 2311121203020200014 |
6 | 33300322235234225 |
7 | 2062303312262546 |
oct | 223076742506551 |
9 | 38715188765868 |
10 | 10110211100009 |
11 | 3248797658749 |
12 | 11735152a8975 |
13 | 5845092c7b77 |
14 | 26d4a0383bcd |
15 | 127eca838a8e |
hex | 931f78a8d69 |
10110211100009 has 2 divisors, whose sum is σ = 10110211100010. Its totient is φ = 10110211100008.
The previous prime is 10110211099999. The next prime is 10110211100107. The reversal of 10110211100009 is 90000111201101.
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., 7197737779600 + 2912473320409 = 2682860^2 + 1706597^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110211100009 - 232 = 10105916132713 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110211100009.
It is not a weakly prime, because it can be changed into another prime (10110211102009) 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, 5055105550004 + 5055105550005.
It is an arithmetic number, because the mean of its divisors is an integer number (5055105550005).
Almost surely, 210110211100009 is an apocalyptic number.
It is an amenable number.
10110211100009 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110211100009 is an equidigital number, since it uses as much as digits as its factorization.
10110211100009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 10110211100009 in words is "ten trillion, one hundred ten billion, two hundred eleven million, one hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •