Base | Representation |
---|---|
bin | 10010110100001100… |
… | …01110001101011101 |
3 | 222001222210010122221 |
4 | 21122012032031131 |
5 | 131141441440401 |
6 | 4350210305341 |
7 | 505216314226 |
oct | 113206161535 |
9 | 28058703587 |
10 | 10101515101 |
11 | 4314050897 |
12 | 1b5ab88251 |
13 | c4ca41792 |
14 | 6bb82a24d |
15 | 3e1c617a1 |
hex | 25a18e35d |
10101515101 has 8 divisors (see below), whose sum is σ = 10269105408. Its totient is φ = 9935250000.
The previous prime is 10101515089. The next prime is 10101515111. The reversal of 10101515101 is 10151510101.
10101515101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10101515101 - 211 = 10101513053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101515111) 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 in 7 ways as a sum of consecutive naturals, for example, 315925 + ... + 346426.
It is an arithmetic number, because the mean of its divisors is an integer number (1283638176).
Almost surely, 210101515101 is an apocalyptic number.
It is an amenable number.
10101515101 is a deficient number, since it is larger than the sum of its proper divisors (167590307).
10101515101 is a wasteful number, since it uses less digits than its factorization.
10101515101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662603.
The product of its (nonzero) digits is 25, while the sum is 16.
Subtracting 10101515101 from its reverse (10151510101), we obtain a triangular number (49995000 = T9999).
The spelling of 10101515101 in words is "ten billion, one hundred one million, five hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •