Base | Representation |
---|---|
bin | 100000001011001001111… |
… | …100001111000111011000 |
3 | 21211100222110211110022112 |
4 | 200023021330033013120 |
5 | 242211112301413422 |
6 | 4411415301011452 |
7 | 315511446056504 |
oct | 40131174170730 |
9 | 7740873743275 |
10 | 2211001201112 |
11 | 7827535a0230 |
12 | 2b860b9b3b88 |
13 | 13065bb0b7b2 |
14 | 79027a75304 |
15 | 3c7a717bee2 |
hex | 202c9f0f1d8 |
2211001201112 has 64 divisors (see below), whose sum is σ = 4787252236800. Its totient is φ = 947779136640.
The previous prime is 2211001201063. The next prime is 2211001201169. The reversal of 2211001201112 is 2111021001122.
It is a super-2 number, since 2×22110012011122 (a number of 25 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 9964448 + ... + 10183919.
It is an arithmetic number, because the mean of its divisors is an integer number (74800816200).
Almost surely, 22211001201112 is an apocalyptic number.
2211001201112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2211001201112 is an abundant number, since it is smaller than the sum of its proper divisors (2576251035688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211001201112 is a wasteful number, since it uses less digits than its factorization.
2211001201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20148456 (or 20148452 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2211001201112 its reverse (2111021001122), we get a palindrome (4322022202234).
The spelling of 2211001201112 in words is "two trillion, two hundred eleven billion, one million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •