Base | Representation |
---|---|
bin | 11011110010011001111110… |
… | …100001101011111010011110 |
3 | 121000201021021020021212211111 |
4 | 123302121332201223322132 |
5 | 112004301334240401342 |
6 | 1111531003043212234 |
7 | 34512314351606026 |
oct | 3362317641537236 |
9 | 530637236255744 |
10 | 122211122200222 |
11 | 35a3849a498900 |
12 | 1185940167707a |
13 | 53265c8322073 |
14 | 222709ac00a86 |
15 | e1ded2234217 |
hex | 6f267e86be9e |
122211122200222 has 12 divisors (see below), whose sum is σ = 201496850239608. Its totient is φ = 55550510090900.
The previous prime is 122211122200171. The next prime is 122211122200249. The reversal of 122211122200222 is 222002221112221.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 122211122200193 and 122211122200202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 252502318354 + ... + 252502318837.
It is an arithmetic number, because the mean of its divisors is an integer number (16791404186634).
Almost surely, 2122211122200222 is an apocalyptic number.
122211122200222 is a deficient number, since it is larger than the sum of its proper divisors (79285728039386).
122211122200222 is a wasteful number, since it uses less digits than its factorization.
122211122200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505004637215 (or 505004637204 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 122211122200222 its reverse (222002221112221), we get a palindrome (344213343312443).
The spelling of 122211122200222 in words is "one hundred twenty-two trillion, two hundred eleven billion, one hundred twenty-two million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •