Base | Representation |
---|---|
bin | 1100010010011111011… |
… | …0111001111111001110 |
3 | 202011221110111000111100 |
4 | 3010213312321333032 |
5 | 11424334224232342 |
6 | 240553235203530 |
7 | 21152542155003 |
oct | 3044766717716 |
9 | 664843430440 |
10 | 211122102222 |
11 | 81599a17219 |
12 | 34b004465a6 |
13 | 16ba7628555 |
14 | a30b2978aa |
15 | 5759ad1e4c |
hex | 3127db9fce |
211122102222 has 12 divisors (see below), whose sum is σ = 457431221520. Its totient is φ = 70374034068.
The previous prime is 211122102199. The next prime is 211122102253. The reversal of 211122102222 is 222201221112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 11729005679 = 211122102222 / (2 + 1 + 1 + 1 + 2 + 2 + 1 + 0 + 2 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 211122102195 and 211122102204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5864502822 + ... + 5864502857.
It is an arithmetic number, because the mean of its divisors is an integer number (38119268460).
Almost surely, 2211122102222 is an apocalyptic number.
211122102222 is an abundant number, since it is smaller than the sum of its proper divisors (246309119298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211122102222 is a wasteful number, since it uses less digits than its factorization.
211122102222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11729005687 (or 11729005684 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 211122102222 its reverse (222201221112), we get a palindrome (433323323334).
The spelling of 211122102222 in words is "two hundred eleven billion, one hundred twenty-two million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.388 sec. • engine limits •