Base | Representation |
---|---|
bin | 10010101110110001… |
… | …101001100110011101 |
3 | 1220220122111120021112 |
4 | 102232301221212131 |
5 | 312142200321341 |
6 | 13123412311405 |
7 | 1311253126004 |
oct | 225661514635 |
9 | 56818446245 |
10 | 20112120221 |
11 | 8590849666 |
12 | 3a93612565 |
13 | 1b869a306b |
14 | d8b14dc3b |
15 | 7caa16aeb |
hex | 4aec6999d |
20112120221 has 8 divisors (see below), whose sum is σ = 20251915200. Its totient is φ = 19972791360.
The previous prime is 20112120191. The next prime is 20112120227. The reversal of 20112120221 is 12202121102.
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 20112120221 - 230 = 19038378397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20112120196 and 20112120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112120227) 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 7 ways as a sum of consecutive naturals, for example, 29711 + ... + 202748.
It is an arithmetic number, because the mean of its divisors is an integer number (2531489400).
Almost surely, 220112120221 is an apocalyptic number.
It is an amenable number.
20112120221 is a deficient number, since it is larger than the sum of its proper divisors (139794979).
20112120221 is a wasteful number, since it uses less digits than its factorization.
20112120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233059.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20112120221 its reverse (12202121102), we get a palindrome (32314241323).
The spelling of 20112120221 in words is "twenty billion, one hundred twelve million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •