Base | Representation |
---|---|
bin | 10110100010101100… |
… | …10011100101011001 |
3 | 1011020102110110222212 |
4 | 23101112103211121 |
5 | 144241132020441 |
6 | 5320520324505 |
7 | 605622113405 |
oct | 132126234531 |
9 | 34212413885 |
10 | 12102220121 |
11 | 515042a112 |
12 | 2419013735 |
13 | 11ab3a49c4 |
14 | 82b42a105 |
15 | 4ac712eeb |
hex | 2d1593959 |
12102220121 has 8 divisors (see below), whose sum is σ = 12158966688. Its totient is φ = 12045528000.
The previous prime is 12102220099. The next prime is 12102220139.
12102220121 is nontrivially palindromic in base 10.
12102220121 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 a de Polignac number, because none of the positive numbers 2k-12102220121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12102220096 and 12102220105.
It is not an unprimeable number, because it can be changed into a prime (12102220421) 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, 472166 + ... + 497136.
It is an arithmetic number, because the mean of its divisors is an integer number (1519870836).
Almost surely, 212102220121 is an apocalyptic number.
It is an amenable number.
12102220121 is a deficient number, since it is larger than the sum of its proper divisors (56746567).
12102220121 is a wasteful number, since it uses less digits than its factorization.
12102220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27223.
The product of its (nonzero) digits is 32, while the sum is 14.
The spelling of 12102220121 in words is "twelve billion, one hundred two million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •