Base | Representation |
---|---|
bin | 1110100101100… |
… | …11010100000101 |
3 | 22112021000002202 |
4 | 13102303110011 |
5 | 222311304120 |
6 | 20050444245 |
7 | 3014056523 |
oct | 722632405 |
9 | 275230082 |
10 | 122369285 |
11 | 6308a945 |
12 | 34b93685 |
13 | 1c47647c |
14 | 12375313 |
15 | ab22875 |
hex | 74b3505 |
122369285 has 8 divisors (see below), whose sum is σ = 146906520. Its totient is φ = 97853184.
The previous prime is 122369267. The next prime is 122369287. The reversal of 122369285 is 582963221.
It can be written as a sum of positive squares in 4 ways, for example, as 10876804 + 111492481 = 3298^2 + 10559^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 122369285 - 212 = 122365189 is a prime.
It is a super-2 number, since 2×1223692852 = 29948483822822450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122369287) 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, 13601 + ... + 20729.
It is an arithmetic number, because the mean of its divisors is an integer number (18363315).
Almost surely, 2122369285 is an apocalyptic number.
It is an amenable number.
122369285 is a deficient number, since it is larger than the sum of its proper divisors (24537235).
122369285 is an equidigital number, since it uses as much as digits as its factorization.
122369285 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10567.
The product of its digits is 51840, while the sum is 38.
The square root of 122369285 is about 11062.0651326956. The cubic root of 122369285 is about 496.4674813996.
The spelling of 122369285 in words is "one hundred twenty-two million, three hundred sixty-nine thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •