Base | Representation |
---|---|
bin | 1001100110001001111100… |
… | …10101110001011100110100 |
3 | 2202201100112000021010221201 |
4 | 10303010332111301130310 |
5 | 10231214321334021322 |
6 | 112514120502422244 |
7 | 4305404455222435 |
oct | 463047625613464 |
9 | 82640460233851 |
10 | 21102220220212 |
11 | 67a64461a936a |
12 | 2449902a31984 |
13 | ba0c14050081 |
14 | 52d4d254748c |
15 | 268db56e9d27 |
hex | 13313e571734 |
21102220220212 has 12 divisors (see below), whose sum is σ = 37091567701440. Its totient is φ = 10504629448376.
The previous prime is 21102220220201. The next prime is 21102220220219. The reversal of 21102220220212 is 21202202220112.
It is a self number, because there is not a number n which added to its sum of digits gives 21102220220212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21102220220219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11620164412 + ... + 11620166227.
It is an arithmetic number, because the mean of its divisors is an integer number (3090963975120).
Almost surely, 221102220220212 is an apocalyptic number.
It is an amenable number.
21102220220212 is a deficient number, since it is larger than the sum of its proper divisors (15989347481228).
21102220220212 is a wasteful number, since it uses less digits than its factorization.
21102220220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23240330870 (or 23240330868 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 21102220220212 its reverse (21202202220112), we get a palindrome (42304422440324).
The spelling of 21102220220212 in words is "twenty-one trillion, one hundred two billion, two hundred twenty million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •