Base | Representation |
---|---|
bin | 1110100011110… |
… | …00110001010001 |
3 | 22111210211011102 |
4 | 13101320301101 |
5 | 222231120424 |
6 | 20041354145 |
7 | 3012040436 |
oct | 721706121 |
9 | 274724142 |
10 | 122129489 |
11 | 62a36769 |
12 | 34a98955 |
13 | 1c3c1291 |
14 | 12311b8d |
15 | aac67ae |
hex | 7478c51 |
122129489 has 8 divisors (see below), whose sum is σ = 126277800. Its totient is φ = 118025856.
The previous prime is 122129461. The next prime is 122129519. The reversal of 122129489 is 984921221.
It can be written as a sum of positive squares in 4 ways, for example, as 2007889 + 120121600 = 1417^2 + 10960^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-122129489 is a prime.
It is a super-2 number, since 2×1221294892 = 29831224166802242, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (122129789) 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 7 ways as a sum of consecutive naturals, for example, 5564 + ... + 16589.
It is an arithmetic number, because the mean of its divisors is an integer number (15784725).
Almost surely, 2122129489 is an apocalyptic number.
It is an amenable number.
122129489 is a deficient number, since it is larger than the sum of its proper divisors (4148311).
122129489 is a wasteful number, since it uses less digits than its factorization.
122129489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22339.
The product of its digits is 20736, while the sum is 38.
The square root of 122129489 is about 11051.2211542435. The cubic root of 122129489 is about 496.1429752259.
The spelling of 122129489 in words is "one hundred twenty-two million, one hundred twenty-nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •