Base | Representation |
---|---|
bin | 1001100011110011000100… |
… | …11010101100100110010010 |
3 | 2202102121110001011010102200 |
4 | 10301321202122230212102 |
5 | 10223402430101042320 |
6 | 112413003214424030 |
7 | 4266506312163504 |
oct | 461714232544622 |
9 | 82377401133380 |
10 | 21021221112210 |
11 | 67750603286a0 |
12 | 2436078502016 |
13 | b963a5c310b7 |
14 | 52960ac13d74 |
15 | 266c24674290 |
hex | 131e626ac992 |
21021221112210 has 48 divisors (see below), whose sum is σ = 59623827157440. Its totient is φ = 5096053602720.
The previous prime is 21021221112197. The next prime is 21021221112253. The reversal of 21021221112210 is 1221112212012.
21021221112210 is a `hidden beast` number, since 21 + 0 + 212 + 211 + 1 + 221 + 0 = 666.
It is a super-2 number, since 2×210212211122102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10616777350 + ... + 10616779329.
It is an arithmetic number, because the mean of its divisors is an integer number (1242163065780).
Almost surely, 221021221112210 is an apocalyptic number.
21021221112210 is an abundant number, since it is smaller than the sum of its proper divisors (38602606045230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21021221112210 is a wasteful number, since it uses less digits than its factorization.
21021221112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21233556703 (or 21233556700 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21021221112210 its reverse (1221112212012), we get a palindrome (22242333324222).
The spelling of 21021221112210 in words is "twenty-one trillion, twenty-one billion, two hundred twenty-one million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •