Base | Representation |
---|---|
bin | 10010101111110110… |
… | …101100100010111101 |
3 | 1220221220120010210220 |
4 | 102233312230202331 |
5 | 312211314021341 |
6 | 13125300251553 |
7 | 1311563022456 |
oct | 225766544275 |
9 | 56856503726 |
10 | 20130220221 |
11 | 859aa91441 |
12 | 3a996a0bb9 |
13 | 1b8a66c717 |
14 | d8d70212d |
15 | 7cc3dea66 |
hex | 4afdac8bd |
20130220221 has 8 divisors (see below), whose sum is σ = 27494935104. Its totient is φ = 13092826080.
The previous prime is 20130220219. The next prime is 20130220237. The reversal of 20130220221 is 12202203102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20130220221 - 21 = 20130220219 is a prime.
It is a super-2 number, since 2×201302202212 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20130220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20130220291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81830041 + ... + 81830286.
It is an arithmetic number, because the mean of its divisors is an integer number (3436866888).
Almost surely, 220130220221 is an apocalyptic number.
It is an amenable number.
20130220221 is a deficient number, since it is larger than the sum of its proper divisors (7364714883).
20130220221 is a wasteful number, since it uses less digits than its factorization.
20130220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163660371.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 20130220221 its reverse (12202203102), we get a palindrome (32332423323).
The spelling of 20130220221 in words is "twenty billion, one hundred thirty million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •