Base | Representation |
---|---|
bin | 100110100110… |
… | …101110100101 |
3 | 201001011011120 |
4 | 212212232211 |
5 | 10042320401 |
6 | 1000524153 |
7 | 152006445 |
oct | 46465645 |
9 | 21034146 |
10 | 10120101 |
11 | 5792422 |
12 | 3480659 |
13 | 2134434 |
14 | 14b6125 |
15 | d4d836 |
hex | 9a6ba5 |
10120101 has 16 divisors (see below), whose sum is σ = 14126400. Its totient is φ = 6435968.
The previous prime is 10120091. The next prime is 10120109. The reversal of 10120101 is 10102101.
It is a cyclic number.
It is not a de Polignac number, because 10120101 - 27 = 10119973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10120101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7090 + ... + 8396.
It is an arithmetic number, because the mean of its divisors is an integer number (882900).
Almost surely, 210120101 is an apocalyptic number.
It is an amenable number.
10120101 is a deficient number, since it is larger than the sum of its proper divisors (4006299).
10120101 is a wasteful number, since it uses less digits than its factorization.
10120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1428.
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 10120101 is about 3181.2106186168. The cubic root of 10120101 is about 216.3025381608.
Adding to 10120101 its reverse (10102101), we get a palindrome (20222202).
Multiplying 10120101 by its reverse (10102101), we get a palindrome (102234282432201).
It can be divided in two parts, 101 and 20101, that added together give a palindrome (20202).
The spelling of 10120101 in words is "ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.016 sec. • engine limits •