Base | Representation |
---|---|
bin | 1001100110011100010111… |
… | …10101000011110101100100 |
3 | 2202202022001021000021202100 |
4 | 10303032023311003311210 |
5 | 10231400100202432322 |
6 | 112522434115212100 |
7 | 4306204525536261 |
oct | 463161365036544 |
9 | 82668037007670 |
10 | 21112110202212 |
11 | 67aa6608aa207 |
12 | 244b802ba7030 |
13 | ba1b2bcc9c23 |
14 | 52db8dc2c268 |
15 | 269293ac4dac |
hex | 13338bd43d64 |
21112110202212 has 72 divisors (see below), whose sum is σ = 53752346575200. Its totient is φ = 6986521795968.
The previous prime is 21112110202199. The next prime is 21112110202279. The reversal of 21112110202212 is 21220201121112.
21112110202212 is a `hidden beast` number, since 211 + 1 + 211 + 0 + 20 + 221 + 2 = 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 (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 264466528 + ... + 264546344.
It is an arithmetic number, because the mean of its divisors is an integer number (746560369100).
Almost surely, 221112110202212 is an apocalyptic number.
It is an amenable number.
21112110202212 is an abundant number, since it is smaller than the sum of its proper divisors (32640236372988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112110202212 is a wasteful number, since it uses less digits than its factorization.
21112110202212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132825 (or 132820 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21112110202212 its reverse (21220201121112), we get a palindrome (42332311323324).
The spelling of 21112110202212 in words is "twenty-one trillion, one hundred twelve billion, one hundred ten million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •