Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …101001101101110101100 |
3 | 21210102012221112100201021 |
4 | 200001313011031232230 |
5 | 242030142401024322 |
6 | 4403045105023524 |
7 | 315006232520500 |
oct | 40016705155654 |
9 | 7712187470637 |
10 | 2201021111212 |
11 | 7794a2044a50 |
12 | 2b66a5624ba4 |
13 | 12c72b2a2861 |
14 | 7875c416300 |
15 | 3c3c0e034c7 |
hex | 2007714dbac |
2201021111212 has 72 divisors (see below), whose sum is σ = 4912794987408. Its totient is φ = 853187529600.
The previous prime is 2201021111197. The next prime is 2201021111243. The reversal of 2201021111212 is 2121111201022.
It is a super-4 number, since 4×22010211112124 (a number of 50 digits) contains 4444 as substring.
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 23 ways as a sum of consecutive naturals, for example, 2166339 + ... + 3015802.
It is an arithmetic number, because the mean of its divisors is an integer number (68233263714).
Almost surely, 22201021111212 is an apocalyptic number.
2201021111212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2201021111212 is an abundant number, since it is smaller than the sum of its proper divisors (2711773876196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201021111212 is a wasteful number, since it uses less digits than its factorization.
2201021111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5182367 (or 5182358 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2201021111212 its reverse (2121111201022), we get a palindrome (4322132312234).
The spelling of 2201021111212 in words is "two trillion, two hundred one billion, twenty-one million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •