Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111111110010101111 |
3 | 102200110001002111001001 |
4 | 1301310102333302233 |
5 | 4000241304034411 |
6 | 132050445101131 |
7 | 11554324512040 |
oct | 1616422776257 |
9 | 380401074031 |
10 | 122210221231 |
11 | 4791353603a |
12 | 1b827b577a7 |
13 | b6a8087197 |
14 | 5cb4ac48c7 |
15 | 32a4040dc1 |
hex | 1c744bfcaf |
122210221231 has 32 divisors (see below), whose sum is σ = 155903311872. Its totient is φ = 93379322880.
The previous prime is 122210221193. The next prime is 122210221249. The reversal of 122210221231 is 132122012221.
It is a cyclic number.
It is not a de Polignac number, because 122210221231 - 217 = 122210090159 is a prime.
It is a super-2 number, since 2×1222102212312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122210221199 and 122210221208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122210221531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 179046 + ... + 525811.
It is an arithmetic number, because the mean of its divisors is an integer number (4871978496).
Almost surely, 2122210221231 is an apocalyptic number.
122210221231 is a deficient number, since it is larger than the sum of its proper divisors (33693090641).
122210221231 is a wasteful number, since it uses less digits than its factorization.
122210221231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704959.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122210221231 its reverse (132122012221), we get a palindrome (254332233452).
The spelling of 122210221231 in words is "one hundred twenty-two billion, two hundred ten million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •