Base | Representation |
---|---|
bin | 101111111110101000011011… |
… | …010110110010001101000000 |
3 | 1000200010120101011220020100200 |
4 | 233332220123112302031000 |
5 | 210124210442231210422 |
6 | 2024441400100445200 |
7 | 62306062036545552 |
oct | 5776503326621500 |
9 | 1020116334806320 |
10 | 211012202210112 |
11 | 61264855086326 |
12 | 1b7bb6b36a9800 |
13 | 90984996c69b4 |
14 | 3a1708b9b34d2 |
15 | 195dda1b0d2ac |
hex | bfea1b5b2340 |
211012202210112 has 84 divisors (see below), whose sum is σ = 604892201053920. Its totient is φ = 70329978577152.
The previous prime is 211012202210107. The next prime is 211012202210143.
211012202210112 is a `hidden beast` number, since 2 + 110 + 1 + 220 + 221 + 0 + 112 = 666.
211012202210112 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2110122022101122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13863898 + ... + 24783705.
Almost surely, 2211012202210112 is an apocalyptic number.
It is an amenable number.
211012202210112 is an abundant number, since it is smaller than the sum of its proper divisors (393879998843808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211012202210112 is a wasteful number, since it uses less digits than its factorization.
211012202210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38657100 (or 38657087 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
It can be divided in two parts, 21101220 and 2210112, that added together give a palindrome (23311332).
The spelling of 211012202210112 in words is "two hundred eleven trillion, twelve billion, two hundred two million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •