Base | Representation |
---|---|
bin | 1100010010110010010… |
… | …0010000110100111000 |
3 | 202012010222010120121011 |
4 | 3010230210100310320 |
5 | 11430014440213422 |
6 | 241005140323304 |
7 | 21154521511321 |
oct | 3045444206470 |
9 | 665128116534 |
10 | 211201101112 |
11 | 8162a574261 |
12 | 34b229a3534 |
13 | 16bbaac8061 |
14 | a31797d448 |
15 | 57619d9077 |
hex | 312c910d38 |
211201101112 has 8 divisors (see below), whose sum is σ = 396002064600. Its totient is φ = 105600550552.
The previous prime is 211201101053. The next prime is 211201101127. The reversal of 211201101112 is 211101102112.
It is a happy number.
211201101112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×2112011011122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211201101092 and 211201101101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13200068812 + ... + 13200068827.
It is an arithmetic number, because the mean of its divisors is an integer number (49500258075).
Almost surely, 2211201101112 is an apocalyptic number.
It is an amenable number.
211201101112 is a deficient number, since it is larger than the sum of its proper divisors (184800963488).
211201101112 is a wasteful number, since it uses less digits than its factorization.
211201101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26400137645 (or 26400137641 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211201101112 its reverse (211101102112), we get a palindrome (422302203224).
The spelling of 211201101112 in words is "two hundred eleven billion, two hundred one million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •