Base | Representation |
---|---|
bin | 1110101000110… |
… | …10000100010111 |
3 | 22120001101102222 |
4 | 13110122010113 |
5 | 222413241132 |
6 | 20103452555 |
7 | 3020461553 |
oct | 724320427 |
9 | 276041388 |
10 | 122790167 |
11 | 63348085 |
12 | 3515715b |
13 | 1c592c06 |
14 | 12444863 |
15 | aba7412 |
hex | 751a117 |
122790167 has 8 divisors (see below), whose sum is σ = 130183200. Its totient is φ = 115416064.
The previous prime is 122790139. The next prime is 122790193. The reversal of 122790167 is 761097221.
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 122790167 - 28 = 122789911 is a prime.
It is a super-2 number, since 2×1227901672 = 30154850223775778, 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 (122790127) 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, 9959 + ... + 18567.
It is an arithmetic number, because the mean of its divisors is an integer number (16272900).
Almost surely, 2122790167 is an apocalyptic number.
122790167 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
122790167 is a deficient number, since it is larger than the sum of its proper divisors (7393033).
122790167 is an equidigital number, since it uses as much as digits as its factorization.
122790167 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9465.
The product of its (nonzero) digits is 10584, while the sum is 35.
The square root of 122790167 is about 11081.0724661469. The cubic root of 122790167 is about 497.0360203683.
The spelling of 122790167 in words is "one hundred twenty-two million, seven hundred ninety thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •