Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1111001100010011100101 |
3 | 1022102012011200112110222200 |
4 | 2101203023233030103211 |
5 | 2302333301103323414 |
6 | 33134522514245113 |
7 | 2051425261215465 |
oct | 221431357142345 |
9 | 38365150473880 |
10 | 10002102011109 |
11 | 320695a91608a |
12 | 1156583886799 |
13 | 57726a79b890 |
14 | 26816637dba5 |
15 | 12529e756109 |
hex | 918cbbcc4e5 |
10002102011109 has 24 divisors (see below), whose sum is σ = 16235296022400. Its totient is φ = 5887524928032.
The previous prime is 10002102011071. The next prime is 10002102011113. The reversal of 10002102011109 is 90111020120001.
It is a happy number.
10002102011109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10002102011109 - 29 = 10002102010597 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10002102011091 and 10002102011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002102011159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1858433209 + ... + 1858438590.
It is an arithmetic number, because the mean of its divisors is an integer number (676470667600).
Almost surely, 210002102011109 is an apocalyptic number.
It is an amenable number.
10002102011109 is a deficient number, since it is larger than the sum of its proper divisors (6233194011291).
10002102011109 is a wasteful number, since it uses less digits than its factorization.
10002102011109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3716871841 (or 3716871838 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 10002102011109 in words is "ten trillion, two billion, one hundred two million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •