Base | Representation |
---|---|
bin | 10000001011110101100… |
… | …110111111000110010100 |
3 | 10221022211200021212110200 |
4 | 100023311212333012110 |
5 | 121210312340401322 |
6 | 2210540421420500 |
7 | 143232621500214 |
oct | 20136546770624 |
9 | 3838750255420 |
10 | 1112222200212 |
11 | 399766488a02 |
12 | 15b680b6a730 |
13 | 80b60c9aac6 |
14 | 3bb90806244 |
15 | 1dde89b38ac |
hex | 102f59bf194 |
1112222200212 has 36 divisors (see below), whose sum is σ = 2847038550720. Its totient is φ = 366047811792.
The previous prime is 1112222200183. The next prime is 1112222200237. The reversal of 1112222200212 is 2120022222111.
It is a happy number.
1112222200212 is a `hidden beast` number, since 1 + 11 + 222 + 220 + 0 + 212 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
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, 195535518 + ... + 195541205.
Almost surely, 21112222200212 is an apocalyptic number.
1112222200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112222200212 is an abundant number, since it is smaller than the sum of its proper divisors (1734816350508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112222200212 is a wasteful number, since it uses less digits than its factorization.
1112222200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391076812 (or 391076807 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1112222200212 its reverse (2120022222111), we get a palindrome (3232244422323).
The spelling of 1112222200212 in words is "one trillion, one hundred twelve billion, two hundred twenty-two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •