Base | Representation |
---|---|
bin | 1110100010110… |
… | …01110010110000 |
3 | 22111120101010010 |
4 | 13101121302300 |
5 | 222213040413 |
6 | 20034534520 |
7 | 3011001510 |
oct | 721316260 |
9 | 274511103 |
10 | 122002608 |
11 | 6295a402 |
12 | 34a37440 |
13 | 1c3785c0 |
14 | 122bb840 |
15 | aa9ddc3 |
hex | 7459cb0 |
122002608 has 320 divisors, whose sum is σ = 431972352. Its totient is φ = 28753920.
The previous prime is 122002589. The next prime is 122002627. The reversal of 122002608 is 806200221.
It is an interprime number because it is at equal distance from previous prime (122002589) and next prime (122002627).
It is a Harshad number since it is a multiple of its sum of digits (21).
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 63 ways as a sum of consecutive naturals, for example, 2301910 + ... + 2301962.
Almost surely, 2122002608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122002608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215986176).
122002608 is an abundant number, since it is smaller than the sum of its proper divisors (309969744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122002608 is a wasteful number, since it uses less digits than its factorization.
122002608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132 (or 126 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 122002608 is about 11045.4790751692. The cubic root of 122002608 is about 495.9711004667.
Adding to 122002608 its reverse (806200221), we get a palindrome (928202829).
The spelling of 122002608 in words is "one hundred twenty-two million, two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •