Base | Representation |
---|---|
bin | 11101000110101001100… |
… | …01010001101110001111 |
3 | 10112121011212101010021221 |
4 | 32203110301101232033 |
5 | 112341001014200421 |
6 | 2043221123304211 |
7 | 132150661413550 |
oct | 16432461215617 |
9 | 3477155333257 |
10 | 1000002100111 |
11 | 35610a12a823 |
12 | 14198281b067 |
13 | 733b8852701 |
14 | 36586832327 |
15 | 1b02ba2d841 |
hex | e8d4c51b8f |
1000002100111 has 16 divisors (see below), whose sum is σ = 1165104460288. Its totient is φ = 840545877600.
The previous prime is 1000002100087. The next prime is 1000002100127. The reversal of 1000002100111 is 1110012000001.
It is a cyclic number.
It is not a de Polignac number, because 1000002100111 - 223 = 999993711503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000002100094 and 1000002100103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000002100411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3396315 + ... + 3678988.
It is an arithmetic number, because the mean of its divisors is an integer number (72819028768).
Almost surely, 21000002100111 is an apocalyptic number.
1000002100111 is a deficient number, since it is larger than the sum of its proper divisors (165102360177).
1000002100111 is an equidigital number, since it uses as much as digits as its factorization.
1000002100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7075702.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1000002100111 its reverse (1110012000001), we get a palindrome (2110014100112).
The spelling of 1000002100111 in words is "one trillion, two million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •