Base | Representation |
---|---|
bin | 10110011000111010… |
… | …00111101000100101 |
3 | 1011000200222100221101 |
4 | 23030131013220211 |
5 | 144104122320401 |
6 | 5304424520101 |
7 | 603604222633 |
oct | 131435075045 |
9 | 34020870841 |
10 | 12020120101 |
11 | 5109054160 |
12 | 23b5620031 |
13 | 119738a802 |
14 | 820578353 |
15 | 4a53e7101 |
hex | 2cc747a25 |
12020120101 has 16 divisors (see below), whose sum is σ = 13602758400. Its totient is φ = 10525881600.
The previous prime is 12020120093. The next prime is 12020120149. The reversal of 12020120101 is 10102102021.
12020120101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12020120101 - 23 = 12020120093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020120171) 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 15 ways as a sum of consecutive naturals, for example, 133056 + ... + 204313.
It is an arithmetic number, because the mean of its divisors is an integer number (850172400).
Almost surely, 212020120101 is an apocalyptic number.
12020120101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12020120101 is a deficient number, since it is larger than the sum of its proper divisors (1582638299).
12020120101 is a wasteful number, since it uses less digits than its factorization.
12020120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337500.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12020120101 its reverse (10102102021), we get a palindrome (22122222122).
The spelling of 12020120101 in words is "twelve billion, twenty million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •