Base | Representation |
---|---|
bin | 1110100011000… |
… | …01111111110000 |
3 | 22111122002012120 |
4 | 13101201333300 |
5 | 222220124313 |
6 | 20035354240 |
7 | 3011201460 |
oct | 721417760 |
9 | 274562176 |
10 | 122036208 |
11 | 62982678 |
12 | 34a52980 |
13 | 1c38a998 |
14 | 122c9ba0 |
15 | aaa8d23 |
hex | 7461ff0 |
122036208 has 80 divisors (see below), whose sum is σ = 361929216. Its totient is φ = 34709760.
The previous prime is 122036207. The next prime is 122036219. The reversal of 122036208 is 802630221.
It is a Cunningham number, because it is equal to 110472-1.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122036207) 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, 87678 + ... + 89058.
Almost surely, 2122036208 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 122036208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180964608).
122036208 is an abundant number, since it is smaller than the sum of its proper divisors (239893008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122036208 is a wasteful number, since it uses less digits than its factorization.
122036208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1662 (or 1656 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 122036208 is about 11046.9999547388. Note that the first 4 decimals coincide. The cubic root of 122036208 is about 496.0166270874.
Adding to 122036208 its reverse (802630221), we get a palindrome (924666429).
The spelling of 122036208 in words is "one hundred twenty-two million, thirty-six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •