Base | Representation |
---|---|
bin | 10010101110110001… |
… | …101010000101011001 |
3 | 1220220122111122222212 |
4 | 102232301222011121 |
5 | 312142200402301 |
6 | 13123412324505 |
7 | 1311253134533 |
oct | 225661520531 |
9 | 56818448885 |
10 | 20112122201 |
11 | 85908500a6 |
12 | 3a93613735 |
13 | 1b869a3c32 |
14 | d8b150853 |
15 | 7caa174bb |
hex | 4aec6a159 |
20112122201 has 4 divisors (see below), whose sum is σ = 20113489872. Its totient is φ = 20110754532.
The previous prime is 20112122197. The next prime is 20112122203. The reversal of 20112122201 is 10222121102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20112122201 - 22 = 20112122197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112122203) 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 3 ways as a sum of consecutive naturals, for example, 661535 + ... + 691268.
It is an arithmetic number, because the mean of its divisors is an integer number (5028372468).
Almost surely, 220112122201 is an apocalyptic number.
It is an amenable number.
20112122201 is a deficient number, since it is larger than the sum of its proper divisors (1367671).
20112122201 is a wasteful number, since it uses less digits than its factorization.
20112122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1367670.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20112122201 its reverse (10222121102), we get a palindrome (30334243303).
It can be divided in two parts, 201121 and 22201, that added together give a palindrome (223322).
The spelling of 20112122201 in words is "twenty billion, one hundred twelve million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •