Base | Representation |
---|---|
bin | 1110100010111… |
… | …10000100101101 |
3 | 22111121021011111 |
4 | 13101132010231 |
5 | 222214121031 |
6 | 20035152021 |
7 | 3011103565 |
oct | 721360455 |
9 | 274537144 |
10 | 122020141 |
11 | 629715a1 |
12 | 34a45611 |
13 | 1c383589 |
14 | 122c3da5 |
15 | aaa41b1 |
hex | 745e12d |
122020141 has 4 divisors (see below), whose sum is σ = 124996284. Its totient is φ = 119044000.
The previous prime is 122020133. The next prime is 122020153. The reversal of 122020141 is 141020221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141020221 = 233 ⋅605237.
It can be written as a sum of positive squares in 2 ways, for example, as 2205225 + 119814916 = 1485^2 + 10946^2 .
It is a cyclic number.
It is not a de Polignac number, because 122020141 - 23 = 122020133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122080141) 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, 1488010 + ... + 1488091.
It is an arithmetic number, because the mean of its divisors is an integer number (31249071).
Almost surely, 2122020141 is an apocalyptic number.
It is an amenable number.
122020141 is a deficient number, since it is larger than the sum of its proper divisors (2976143).
122020141 is an equidigital number, since it uses as much as digits as its factorization.
122020141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2976142.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 122020141 is about 11046.2727197911. The cubic root of 122020141 is about 495.9948580047.
Adding to 122020141 its reverse (141020221), we get a palindrome (263040362).
The spelling of 122020141 in words is "one hundred twenty-two million, twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •