Base | Representation |
---|---|
bin | 1110100101000… |
… | …00010000111001 |
3 | 22112010001001211 |
4 | 13102200100321 |
5 | 222301310012 |
6 | 20045043121 |
7 | 3013313164 |
oct | 722402071 |
9 | 275101054 |
10 | 122291257 |
11 | 63037260 |
12 | 34b564a1 |
13 | 1c449aba |
14 | 12354adb |
15 | ab096a7 |
hex | 74a0439 |
122291257 has 4 divisors (see below), whose sum is σ = 133408656. Its totient is φ = 111173860.
The previous prime is 122291219. The next prime is 122291293. The reversal of 122291257 is 752192221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122291257 - 215 = 122258489 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122291357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5558683 + ... + 5558704.
It is an arithmetic number, because the mean of its divisors is an integer number (33352164).
Almost surely, 2122291257 is an apocalyptic number.
It is an amenable number.
122291257 is a deficient number, since it is larger than the sum of its proper divisors (11117399).
122291257 is a wasteful number, since it uses less digits than its factorization.
122291257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11117398.
The product of its digits is 5040, while the sum is 31.
The square root of 122291257 is about 11058.5377423961. The cubic root of 122291257 is about 496.3619358473.
The spelling of 122291257 in words is "one hundred twenty-two million, two hundred ninety-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •