Base | Representation |
---|---|
bin | 1110100111110… |
… | …01010100101111 |
3 | 22112210120110120 |
4 | 13103321110233 |
5 | 222344443142 |
6 | 20100540023 |
7 | 3016362543 |
oct | 723712457 |
9 | 275716416 |
10 | 122656047 |
11 | 63266338 |
12 | 350b1613 |
13 | 1c546b57 |
14 | 1240ba23 |
15 | ab7c7ec |
hex | 74f952f |
122656047 has 8 divisors (see below), whose sum is σ = 163868544. Its totient is φ = 81607128.
The previous prime is 122656019. The next prime is 122656049. The reversal of 122656047 is 740656221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122656047 - 210 = 122655023 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 122655999 and 122656017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122656049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39133 + ... + 42150.
It is an arithmetic number, because the mean of its divisors is an integer number (20483568).
Almost surely, 2122656047 is an apocalyptic number.
122656047 is a deficient number, since it is larger than the sum of its proper divisors (41212497).
122656047 is an equidigital number, since it uses as much as digits as its factorization.
122656047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81789.
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 122656047 is about 11075.0190519023. The cubic root of 122656047 is about 496.8549886169.
The spelling of 122656047 in words is "one hundred twenty-two million, six hundred fifty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •