Base | Representation |
---|---|
bin | 1001000110001100110011… |
… | …1011100001010100001111 |
3 | 1022102012020002012001011211 |
4 | 2101203030323201110033 |
5 | 2302333321214120421 |
6 | 33134524511155251 |
7 | 2051425623252664 |
oct | 221431473412417 |
9 | 38365202161154 |
10 | 10002122020111 |
11 | 3206970142151 |
12 | 115658a515b27 |
13 | 577271986120 |
14 | 268168caba6b |
15 | 1252a13a99e1 |
hex | 918ccee150f |
10002122020111 has 8 divisors (see below), whose sum is σ = 10771577709984. Its totient is φ = 9232675142880.
The previous prime is 10002122020103. The next prime is 10002122020159. The reversal of 10002122020111 is 11102022120001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10002122020111 - 23 = 10002122020103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 10002122020091 and 10002122020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002122020811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 255750 + ... + 4479916.
It is an arithmetic number, because the mean of its divisors is an integer number (1346447213748).
Almost surely, 210002122020111 is an apocalyptic number.
10002122020111 is a deficient number, since it is larger than the sum of its proper divisors (769455689873).
10002122020111 is a wasteful number, since it uses less digits than its factorization.
10002122020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4406321.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10002122020111 its reverse (11102022120001), we get a palindrome (21104144140112).
The spelling of 10002122020111 in words is "ten trillion, two billion, one hundred twenty-two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •