Base | Representation |
---|---|
bin | 101111111110101000001111… |
… | …010111010001100110010000 |
3 | 1000200010112212011022022120220 |
4 | 233332220033113101212100 |
5 | 210124210034224341422 |
6 | 2024441324112233040 |
7 | 62306054044441506 |
oct | 5776501727214620 |
9 | 1020115764268526 |
10 | 211012001012112 |
11 | 61264761555293 |
12 | 1b7bb65823b780 |
13 | 9098466b10321 |
14 | 3a1706cd9c676 |
15 | 195dd8e118e5c |
hex | bfea0f5d1990 |
211012001012112 has 20 divisors (see below), whose sum is σ = 545114335948080. Its totient is φ = 70337333670688.
The previous prime is 211012001012077. The next prime is 211012001012123. The reversal of 211012001012112 is 211210100210112.
It is a happy number.
It is a super-2 number, since 2×2110120010121122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211012001012091 and 211012001012100.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2198041677162 + ... + 2198041677257.
It is an arithmetic number, because the mean of its divisors is an integer number (27255716797404).
Almost surely, 2211012001012112 is an apocalyptic number.
It is an amenable number.
211012001012112 is an abundant number, since it is smaller than the sum of its proper divisors (334102334935968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211012001012112 is a wasteful number, since it uses less digits than its factorization.
211012001012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4396083354430 (or 4396083354424 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211012001012112 its reverse (211210100210112), we get a palindrome (422222101222224).
The spelling of 211012001012112 in words is "two hundred eleven trillion, twelve billion, one million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •