Base | Representation |
---|---|
bin | 1110100111110… |
… | …00011111010110 |
3 | 22112210101210000 |
4 | 13103320133112 |
5 | 222344341010 |
6 | 20100512130 |
7 | 3016346562 |
oct | 723703726 |
9 | 275711700 |
10 | 122652630 |
11 | 63263811 |
12 | 350ab646 |
13 | 1c545429 |
14 | 1240a6a2 |
15 | ab7b7c0 |
hex | 74f87d6 |
122652630 has 40 divisors (see below), whose sum is σ = 329801472. Its totient is φ = 32707152.
The previous prime is 122652623. The next prime is 122652631. The reversal of 122652630 is 36256221.
122652630 is a `hidden beast` number, since 1 + 2 + 2 + 652 + 6 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 122652594 and 122652603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122652631) 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 19 ways as a sum of consecutive naturals, for example, 74902 + ... + 76521.
Almost surely, 2122652630 is an apocalyptic number.
122652630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122652630 is an abundant number, since it is smaller than the sum of its proper divisors (207148842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122652630 is a wasteful number, since it uses less digits than its factorization.
122652630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151442 (or 151433 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 122652630 is about 11074.8647847276. The cubic root of 122652630 is about 496.8503747141.
The spelling of 122652630 in words is "one hundred twenty-two million, six hundred fifty-two thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •