Base | Representation |
---|---|
bin | 11011110010010001011110… |
… | …111010111011010001001011 |
3 | 121000200101201122001021111022 |
4 | 123302101132322323101023 |
5 | 112004124200003324321 |
6 | 1111522454050023055 |
7 | 34511542346355503 |
oct | 3362213672732113 |
9 | 530611648037438 |
10 | 122202002011211 |
11 | 35a3463a376911 |
12 | 11857697277a8b |
13 | 53257a39acb15 |
14 | 2226873860a03 |
15 | e1db4b715dab |
hex | 6f245eebb44b |
122202002011211 has 16 divisors (see below), whose sum is σ = 129527996976000. Its totient is φ = 114891365468160.
The previous prime is 122202002011147. The next prime is 122202002011213. The reversal of 122202002011211 is 112110200202221.
It is a cyclic number.
It is not a de Polignac number, because 122202002011211 - 26 = 122202002011147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122202002011211.
It is not an unprimeable number, because it can be changed into a prime (122202002011213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59375981 + ... + 61399601.
It is an arithmetic number, because the mean of its divisors is an integer number (8095499811000).
Almost surely, 2122202002011211 is an apocalyptic number.
122202002011211 is a deficient number, since it is larger than the sum of its proper divisors (7325994964789).
122202002011211 is a wasteful number, since it uses less digits than its factorization.
122202002011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2027414.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122202002011211 its reverse (112110200202221), we get a palindrome (234312202213432).
The spelling of 122202002011211 in words is "one hundred twenty-two trillion, two hundred two billion, two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •