Base | Representation |
---|---|
bin | 1001101001000100001100… |
… | …10100100001111111100000 |
3 | 2210001220121121122001021001 |
4 | 10310202012110201333200 |
5 | 10234334112244231422 |
6 | 113032054535441344 |
7 | 4315544403210136 |
oct | 464420624417740 |
9 | 83056547561231 |
10 | 21202212102112 |
11 | 6834897a9a198 |
12 | 2465169b26254 |
13 | baa48ac796b2 |
14 | 53429a493756 |
15 | 26b7b8d7e227 |
hex | 134886521fe0 |
21202212102112 has 24 divisors (see below), whose sum is σ = 41921004683376. Its totient is φ = 10555607738112.
The previous prime is 21202212102053. The next prime is 21202212102139. The reversal of 21202212102112 is 21120121220212.
It is a super-3 number, since 3×212022121021123 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21202212102112.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 1421814708 + ... + 1421829619.
It is an arithmetic number, because the mean of its divisors is an integer number (1746708528474).
Almost surely, 221202212102112 is an apocalyptic number.
It is an amenable number.
21202212102112 is a deficient number, since it is larger than the sum of its proper divisors (20718792581264).
21202212102112 is a wasteful number, since it uses less digits than its factorization.
21202212102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2843644570 (or 2843644562 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21202212102112 its reverse (21120121220212), we get a palindrome (42322333322324).
The spelling of 21202212102112 in words is "twenty-one trillion, two hundred two billion, two hundred twelve million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •