Base | Representation |
---|---|
bin | 10000010101001000111… |
… | …111101010010100010100 |
3 | 10222021121211012011201101 |
4 | 100111020333222110110 |
5 | 121341242021042322 |
6 | 2215311530435444 |
7 | 144035303031511 |
oct | 20251077522424 |
9 | 3867554164641 |
10 | 1122211112212 |
11 | 3a2a21a0a383 |
12 | 1615aa292b84 |
13 | 81a935a5418 |
14 | 3c45b2c0308 |
15 | 1e2d08d1327 |
hex | 10548fea514 |
1122211112212 has 12 divisors (see below), whose sum is σ = 2067230996320. Its totient is φ = 531573684696.
The previous prime is 1122211112207. The next prime is 1122211112213. The reversal of 1122211112212 is 2122111122211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1122211112212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122211112213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7382967768 + ... + 7382967919.
Almost surely, 21122211112212 is an apocalyptic number.
It is an amenable number.
1122211112212 is a deficient number, since it is larger than the sum of its proper divisors (945019884108).
1122211112212 is a wasteful number, since it uses less digits than its factorization.
1122211112212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14765935710 (or 14765935708 counting only the distinct ones).
The product of its digits is 64, while the sum is 19.
Adding to 1122211112212 its reverse (2122111122211), we get a palindrome (3244322234423).
Subtracting 1122211112212 from its reverse (2122111122211), we obtain a palindrome (999900009999).
The spelling of 1122211112212 in words is "one trillion, one hundred twenty-two billion, two hundred eleven million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •