Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111110000101010111 |
3 | 102200110001002010102210 |
4 | 1301310102332011113 |
5 | 4000241303323411 |
6 | 132050445004503 |
7 | 11554324452450 |
oct | 1616422760527 |
9 | 380401063383 |
10 | 122210214231 |
11 | 47913530856 |
12 | 1b827b53733 |
13 | b6a8083c41 |
14 | 5cb4ac2127 |
15 | 32a403dca6 |
hex | 1c744be157 |
122210214231 has 16 divisors (see below), whose sum is σ = 191258200064. Its totient is φ = 67946991264.
The previous prime is 122210214209. The next prime is 122210214239. The reversal of 122210214231 is 132412012221.
It is a happy number.
It is not a de Polignac number, because 122210214231 - 211 = 122210212183 is a prime.
It is a super-2 number, since 2×1222102142312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122210214198 and 122210214207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122210214239) 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, 78641575 + ... + 78643128.
It is an arithmetic number, because the mean of its divisors is an integer number (11953637504).
Almost surely, 2122210214231 is an apocalyptic number.
122210214231 is a deficient number, since it is larger than the sum of its proper divisors (69047985833).
122210214231 is a wasteful number, since it uses less digits than its factorization.
122210214231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157284750.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 122210214231 its reverse (132412012221), we get a palindrome (254622226452).
The spelling of 122210214231 in words is "one hundred twenty-two billion, two hundred ten million, two hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •