Base | Representation |
---|---|
bin | 1001100110011100100011… |
… | …11010001100001000100010 |
3 | 2202202022022100221211102100 |
4 | 10303032101322030020202 |
5 | 10231400302311211320 |
6 | 112522452201431230 |
7 | 4306210204563552 |
oct | 463162172141042 |
9 | 82668270854370 |
10 | 21112212210210 |
11 | 67aa703442340 |
12 | 244b83119b516 |
13 | ba1b471946a4 |
14 | 52db9d5c3162 |
15 | 26929ca24790 |
hex | 133391e8c222 |
21112212210210 has 96 divisors (see below), whose sum is σ = 60212750794560. Its totient is φ = 5089835145600.
The previous prime is 21112212210179. The next prime is 21112212210233. The reversal of 21112212210210 is 1201221221112.
21112212210210 is a `hidden beast` number, since 2 + 1 + 11 + 221 + 221 + 0 + 210 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 58730940 + ... + 59089319.
It is an arithmetic number, because the mean of its divisors is an integer number (627216154110).
Almost surely, 221112212210210 is an apocalyptic number.
21112212210210 is an abundant number, since it is smaller than the sum of its proper divisors (39100538584350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112212210210 is a wasteful number, since it uses less digits than its factorization.
21112212210210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117820464 (or 117820461 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21112212210210 its reverse (1201221221112), we get a palindrome (22313433431322).
The spelling of 21112212210210 in words is "twenty-one trillion, one hundred twelve billion, two hundred twelve million, two hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •