Base | Representation |
---|---|
bin | 1110101010001… |
… | …00110001001101 |
3 | 22120101021100211 |
4 | 13111010301031 |
5 | 222434340234 |
6 | 20111322421 |
7 | 3022120513 |
oct | 725046115 |
9 | 276337324 |
10 | 122965069 |
11 | 63457527 |
12 | 35220411 |
13 | 1c6246c6 |
14 | 1248c4b3 |
15 | abde164 |
hex | 7544c4d |
122965069 has 8 divisors (see below), whose sum is σ = 125455160. Its totient is φ = 120496896.
The previous prime is 122965067. The next prime is 122965091. The reversal of 122965069 is 960569221.
It can be written as a sum of positive squares in 4 ways, for example, as 23164969 + 99800100 = 4813^2 + 9990^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122965069 - 21 = 122965067 is a prime.
It is a super-2 number, since 2×1229650692 = 30240816388349522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122965067) 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, 6097 + ... + 16825.
It is an arithmetic number, because the mean of its divisors is an integer number (15681895).
Almost surely, 2122965069 is an apocalyptic number.
It is an amenable number.
122965069 is a deficient number, since it is larger than the sum of its proper divisors (2490091).
122965069 is a wasteful number, since it uses less digits than its factorization.
122965069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10959.
The product of its (nonzero) digits is 58320, while the sum is 40.
The square root of 122965069 is about 11088.9615834847. The cubic root of 122965069 is about 497.2719006869.
The spelling of 122965069 in words is "one hundred twenty-two million, nine hundred sixty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •