Base | Representation |
---|---|
bin | 1110100110100… |
… | …01010011101101 |
3 | 22112111020121222 |
4 | 13103101103231 |
5 | 222324222031 |
6 | 20053233125 |
7 | 3015110642 |
oct | 723212355 |
9 | 275436558 |
10 | 122492141 |
11 | 63164182 |
12 | 350327a5 |
13 | 1c4ba375 |
14 | 123a7dc9 |
15 | ab48e7b |
hex | 74d14ed |
122492141 has 4 divisors (see below), whose sum is σ = 122521212. Its totient is φ = 122463072.
The previous prime is 122492101. The next prime is 122492159. The reversal of 122492141 is 141294221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141294221 = 23 ⋅6143227.
It can be written as a sum of positive squares in 2 ways, for example, as 40589641 + 81902500 = 6371^2 + 9050^2 .
It is a cyclic number.
It is not a de Polignac number, because 122492141 - 26 = 122492077 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122492141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122492101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6866 + ... + 17091.
It is an arithmetic number, because the mean of its divisors is an integer number (30630303).
Almost surely, 2122492141 is an apocalyptic number.
It is an amenable number.
122492141 is a deficient number, since it is larger than the sum of its proper divisors (29071).
122492141 is an equidigital number, since it uses as much as digits as its factorization.
122492141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29070.
The product of its digits is 1152, while the sum is 26.
The square root of 122492141 is about 11067.6167714644. The cubic root of 122492141 is about 496.6335732095.
The spelling of 122492141 in words is "one hundred twenty-two million, four hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •