Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010111110001111101 |
3 | 1220220111220121222212 |
4 | 102232222113301331 |
5 | 312141203242341 |
6 | 13123303350205 |
7 | 1311230661221 |
oct | 225652276175 |
9 | 56814817885 |
10 | 20110212221 |
11 | 858a766100 |
12 | 3a92a52365 |
13 | 1b86485778 |
14 | d8abb4781 |
15 | 7ca78b5eb |
hex | 4aea97c7d |
20110212221 has 24 divisors (see below), whose sum is σ = 22733299512. Its totient is φ = 17765580800.
The previous prime is 20110212211. The next prime is 20110212253. The reversal of 20110212221 is 12221201102.
It can be written as a sum of positive squares in 4 ways, for example, as 4357452121 + 15752760100 = 66011^2 + 125510^2 .
It is not a de Polignac number, because 20110212221 - 210 = 20110211197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110212196 and 20110212205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110212211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1267091 + ... + 1282863.
It is an arithmetic number, because the mean of its divisors is an integer number (947220813).
Almost surely, 220110212221 is an apocalyptic number.
It is an amenable number.
20110212221 is a deficient number, since it is larger than the sum of its proper divisors (2623087291).
20110212221 is a wasteful number, since it uses less digits than its factorization.
20110212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16093 (or 16082 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20110212221 its reverse (12221201102), we get a palindrome (32331413323).
It can be divided in two parts, 201102 and 12221, that multiplied together give a palindrome (2457667542).
The spelling of 20110212221 in words is "twenty billion, one hundred ten million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •