Base | Representation |
---|---|
bin | 1110100101010… |
… | …00101001100101 |
3 | 22112011210011222 |
4 | 13102220221211 |
5 | 222303404410 |
6 | 20045510125 |
7 | 3013515263 |
oct | 722505145 |
9 | 275153158 |
10 | 122325605 |
11 | 63060046 |
12 | 34b72345 |
13 | 1c45c61c |
14 | 12363433 |
15 | ab14955 |
hex | 74a8a65 |
122325605 has 8 divisors (see below), whose sum is σ = 148440600. Its totient is φ = 96760576.
The previous prime is 122325571. The next prime is 122325607. The reversal of 122325605 is 506523221.
It can be written as a sum of positive squares in 4 ways, for example, as 20376196 + 101949409 = 4514^2 + 10097^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 122325605 - 216 = 122260069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122325607) 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, 137000 + ... + 137889.
It is an arithmetic number, because the mean of its divisors is an integer number (18555075).
Almost surely, 2122325605 is an apocalyptic number.
It is an amenable number.
122325605 is a deficient number, since it is larger than the sum of its proper divisors (26114995).
122325605 is an equidigital number, since it uses as much as digits as its factorization.
122325605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274983.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 122325605 is about 11060.0906415816. The cubic root of 122325605 is about 496.4084026301.
Adding to 122325605 its reverse (506523221), we get a palindrome (628848826).
The spelling of 122325605 in words is "one hundred twenty-two million, three hundred twenty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •