Base | Representation |
---|---|
bin | 1110100100011… |
… | …01010100001110 |
3 | 22111222002121100 |
4 | 13102031110032 |
5 | 222241314041 |
6 | 20043243530 |
7 | 3012541002 |
oct | 722152416 |
9 | 274862540 |
10 | 122213646 |
11 | 62a93a15 |
12 | 34b195a6 |
13 | 1c420689 |
14 | 12334702 |
15 | aae16b6 |
hex | 748d50e |
122213646 has 24 divisors (see below), whose sum is σ = 280373184. Its totient is φ = 38341440.
The previous prime is 122213639. The next prime is 122213653. The reversal of 122213646 is 646312221.
122213646 is a `hidden beast` number, since 1 + 2 + 2 + 2 + 13 + 646 = 666.
It is an interprime number because it is at equal distance from previous prime (122213639) and next prime (122213653).
It is a super-2 number, since 2×1222136462 = 29872350537226632, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 199390 + ... + 200001.
It is an arithmetic number, because the mean of its divisors is an integer number (11682216).
Almost surely, 2122213646 is an apocalyptic number.
122213646 is an abundant number, since it is smaller than the sum of its proper divisors (158159538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122213646 is a wasteful number, since it uses less digits than its factorization.
122213646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399416 (or 399413 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
The square root of 122213646 is about 11055.0280868029. The cubic root of 122213646 is about 496.2569098095.
Adding to 122213646 its reverse (646312221), we get a palindrome (768525867).
The spelling of 122213646 in words is "one hundred twenty-two million, two hundred thirteen thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •