Base | Representation |
---|---|
bin | 10010101001100001… |
… | …01111111101100101 |
3 | 221211202100022011120 |
4 | 21110300233331211 |
5 | 131001033000401 |
6 | 4333251524153 |
7 | 503051411445 |
oct | 112460577545 |
9 | 27752308146 |
10 | 10012000101 |
11 | 4278570954 |
12 | 1b34bb9659 |
13 | c3732c51c |
14 | 6ad9a8125 |
15 | 3d8e7d836 |
hex | 254c2ff65 |
10012000101 has 4 divisors (see below), whose sum is σ = 13349333472. Its totient is φ = 6674666732.
The previous prime is 10012000093. The next prime is 10012000127. The reversal of 10012000101 is 10100021001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10012000101 - 23 = 10012000093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10012000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012000171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1668666681 + ... + 1668666686.
It is an arithmetic number, because the mean of its divisors is an integer number (3337333368).
Almost surely, 210012000101 is an apocalyptic number.
It is an amenable number.
10012000101 is a deficient number, since it is larger than the sum of its proper divisors (3337333371).
10012000101 is an equidigital number, since it uses as much as digits as its factorization.
10012000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3337333370.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 10012000101 its reverse (10100021001), we get a palindrome (20112021102).
The spelling of 10012000101 in words is "ten billion, twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •