Base | Representation |
---|---|
bin | 11011110001000111001011… |
… | …101110001111010001101101 |
3 | 121000101202210200210202222001 |
4 | 123301013023232033101231 |
5 | 112001322303043220323 |
6 | 1111422101425252301 |
7 | 34503016350223660 |
oct | 3361071356172155 |
9 | 530352720722861 |
10 | 122122223023213 |
11 | 35a038201a4386 |
12 | 11844131494091 |
13 | 531b0cb5ab24a |
14 | 2222a661b76d7 |
15 | e1ba2c8523ad |
hex | 6f11cbb8f46d |
122122223023213 has 16 divisors (see below), whose sum is σ = 143341872239104. Its totient is φ = 101846037450240.
The previous prime is 122122223023193. The next prime is 122122223023217. The reversal of 122122223023213 is 312320322221221.
It is a cyclic number.
It is not a de Polignac number, because 122122223023213 - 25 = 122122223023181 is a prime.
It is a super-2 number, since 2×1221222230232132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122122223023217) 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, 22785373 + ... + 27630013.
It is an arithmetic number, because the mean of its divisors is an integer number (8958867014944).
Almost surely, 2122122223023213 is an apocalyptic number.
It is an amenable number.
122122223023213 is a deficient number, since it is larger than the sum of its proper divisors (21219649215891).
122122223023213 is an equidigital number, since it uses as much as digits as its factorization.
122122223023213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4942012.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 122122223023213 its reverse (312320322221221), we get a palindrome (434442545244434).
The spelling of 122122223023213 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, two hundred twenty-three million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •