Base | Representation |
---|---|
bin | 10110100100110101… |
… | …00101101110011101 |
3 | 1011021200010220022112 |
4 | 23102122211232131 |
5 | 144310222321341 |
6 | 5322400123405 |
7 | 606230215316 |
oct | 132232455635 |
9 | 34250126275 |
10 | 12120120221 |
11 | 515a545790 |
12 | 2423006565 |
13 | 11b2001391 |
14 | 82d96960d |
15 | 4ae09baeb |
hex | 2d26a5b9d |
12120120221 has 16 divisors (see below), whose sum is σ = 13408234560. Its totient is φ = 10863905280.
The previous prime is 12120120169. The next prime is 12120120263. The reversal of 12120120221 is 12202102121.
It is a cyclic number.
It is not a de Polignac number, because 12120120221 - 226 = 12053011357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12120120196 and 12120120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120120281) 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 15 ways as a sum of consecutive naturals, for example, 265910 + ... + 308136.
It is an arithmetic number, because the mean of its divisors is an integer number (838014660).
Almost surely, 212120120221 is an apocalyptic number.
12120120221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12120120221 is a deficient number, since it is larger than the sum of its proper divisors (1288114339).
12120120221 is a wasteful number, since it uses less digits than its factorization.
12120120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42604.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12120120221 its reverse (12202102121), we get a palindrome (24322222342).
The spelling of 12120120221 in words is "twelve billion, one hundred twenty million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •