Base | Representation |
---|---|
bin | 11011110010011010000100… |
… | …100011011101110101011111 |
3 | 121000201021112021120211000010 |
4 | 123302122010203131311133 |
5 | 112004302041133031033 |
6 | 1111531021054534303 |
7 | 34512320020315323 |
oct | 3362320443356537 |
9 | 530637467524003 |
10 | 122211223330143 |
11 | 35a38541591252 |
12 | 1185942b507393 |
13 | 532661326cc5c |
14 | 22270aa407983 |
15 | e1dedb05d863 |
hex | 6f26848ddd5f |
122211223330143 has 16 divisors (see below), whose sum is σ = 163393660474880. Its totient is φ = 81251471238336.
The previous prime is 122211223330121. The next prime is 122211223330169. The reversal of 122211223330143 is 341033322112221.
It is not a de Polignac number, because 122211223330143 - 216 = 122211223264607 is a prime.
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 122211223330143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122211223370143) 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, 155583603 + ... + 156367131.
It is an arithmetic number, because the mean of its divisors is an integer number (10212103779680).
Almost surely, 2122211223330143 is an apocalyptic number.
122211223330143 is a deficient number, since it is larger than the sum of its proper divisors (41182437144737).
122211223330143 is a wasteful number, since it uses less digits than its factorization.
122211223330143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925566.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 122211223330143 its reverse (341033322112221), we get a palindrome (463244545442364).
The spelling of 122211223330143 in words is "one hundred twenty-two trillion, two hundred eleven billion, two hundred twenty-three million, three hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •