Base | Representation |
---|---|
bin | 10011110000110100… |
… | …010001010000100001 |
3 | 2000202212100221012012 |
4 | 103300310101100201 |
5 | 321424321300301 |
6 | 13425352242305 |
7 | 1350565621043 |
oct | 236064212041 |
9 | 60685327165 |
10 | 21220103201 |
11 | 8aaa216680 |
12 | 41426a0395 |
13 | 20023ba4ab |
14 | 1054369a93 |
15 | 842e27ebb |
hex | 4f0d11421 |
21220103201 has 16 divisors (see below), whose sum is σ = 23315278848. Its totient is φ = 19152806400.
The previous prime is 21220103141. The next prime is 21220103221. The reversal of 21220103201 is 10230102212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 21220103201 - 226 = 21152994337 is a prime.
It is a super-2 number, since 2×212201032012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21220103221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2536241 + ... + 2544593.
It is an arithmetic number, because the mean of its divisors is an integer number (1457204928).
Almost surely, 221220103201 is an apocalyptic number.
It is an amenable number.
21220103201 is a deficient number, since it is larger than the sum of its proper divisors (2095175647).
21220103201 is a wasteful number, since it uses less digits than its factorization.
21220103201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9992.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 21220103201 its reverse (10230102212), we get a palindrome (31450205413).
It can be divided in two parts, 21220 and 103201, that added together give a palindrome (124421).
The spelling of 21220103201 in words is "twenty-one billion, two hundred twenty million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •