Base | Representation |
---|---|
bin | 1110100010110… |
… | …11010100000101 |
3 | 22111120200122211 |
4 | 13101123110011 |
5 | 222213240322 |
6 | 20035023421 |
7 | 3011025616 |
oct | 721332405 |
9 | 274520584 |
10 | 122008837 |
11 | 62964055 |
12 | 34a3ab71 |
13 | 1c37b3a2 |
14 | 122bdc0d |
15 | aaa0b77 |
hex | 745b505 |
122008837 has 4 divisors (see below), whose sum is σ = 122059756. Its totient is φ = 121957920.
The previous prime is 122008801. The next prime is 122008849. The reversal of 122008837 is 738800221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35034561 + 86974276 = 5919^2 + 9326^2 .
It is a cyclic number.
It is not a de Polignac number, because 122008837 - 219 = 121484549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122008799 and 122008808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122008037) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 21678 + ... + 26719.
It is an arithmetic number, because the mean of its divisors is an integer number (30514939).
Almost surely, 2122008837 is an apocalyptic number.
It is an amenable number.
122008837 is a deficient number, since it is larger than the sum of its proper divisors (50919).
122008837 is an equidigital number, since it uses as much as digits as its factorization.
122008837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50918.
The product of its (nonzero) digits is 5376, while the sum is 31.
The square root of 122008837 is about 11045.7610421374. The cubic root of 122008837 is about 495.9795411371.
The spelling of 122008837 in words is "one hundred twenty-two million, eight thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •