Base | Representation |
---|---|
bin | 111001000111010101… |
… | …0001100000001011101 |
3 | 102201120212022222202212 |
4 | 1302032222030001131 |
5 | 4002143020231003 |
6 | 132202404530205 |
7 | 11601305055422 |
oct | 1621652140135 |
9 | 381525288685 |
10 | 122652508253 |
11 | 48020163900 |
12 | 1b9300b0965 |
13 | b7488b3292 |
14 | 5d17735d49 |
15 | 32ccca8dd8 |
hex | 1c8ea8c05d |
122652508253 has 24 divisors (see below), whose sum is σ = 136384405248. Its totient is φ = 110209572000.
The previous prime is 122652508247. The next prime is 122652508291. The reversal of 122652508253 is 352805256221.
It is not a de Polignac number, because 122652508253 - 232 = 118357540957 is a prime.
It is a super-2 number, since 2×1226525082532 (a number of 23 digits) contains 22 as substring.
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 122652508253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122652508453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6733388 + ... + 6751578.
It is an arithmetic number, because the mean of its divisors is an integer number (5682683552).
Almost surely, 2122652508253 is an apocalyptic number.
It is an amenable number.
122652508253 is a deficient number, since it is larger than the sum of its proper divisors (13731896995).
122652508253 is a wasteful number, since it uses less digits than its factorization.
122652508253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18857 (or 18846 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 122652508253 in words is "one hundred twenty-two billion, six hundred fifty-two million, five hundred eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •