Base | Representation |
---|---|
bin | 10010101000010101… |
… | …01001011111001101 |
3 | 221211001112212012221 |
4 | 21110022221133031 |
5 | 130441003341414 |
6 | 4332253455341 |
7 | 502600462105 |
oct | 112412513715 |
9 | 27731485187 |
10 | 10002012109 |
11 | 4272969811 |
12 | 1b317a1551 |
13 | c3524327b |
14 | 6ac528205 |
15 | 3d8159224 |
hex | 2542a97cd |
10002012109 has 2 divisors, whose sum is σ = 10002012110. Its totient is φ = 10002012108.
The previous prime is 10002012107. The next prime is 10002012131. The reversal of 10002012109 is 90121020001.
10002012109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9998000100 + 4012009 = 99990^2 + 2003^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002012109 - 21 = 10002012107 is a prime.
Together with 10002012107, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10002012092 and 10002012101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002012107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001006054 + 5001006055.
It is an arithmetic number, because the mean of its divisors is an integer number (5001006055).
Almost surely, 210002012109 is an apocalyptic number.
It is an amenable number.
10002012109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002012109 is an equidigital number, since it uses as much as digits as its factorization.
10002012109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 10002012109 in words is "ten billion, two million, twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •