Base | Representation |
---|---|
bin | 1110100011110… |
… | …01001111011101 |
3 | 22111210220210222 |
4 | 13101321033131 |
5 | 222231201141 |
6 | 20041411125 |
7 | 3012046166 |
oct | 721711735 |
9 | 274726728 |
10 | 122131421 |
11 | 62a38165 |
12 | 34a99aa5 |
13 | 1c3c2119 |
14 | 1231276d |
15 | aac714b |
hex | 74793dd |
122131421 has 2 divisors, whose sum is σ = 122131422. Its totient is φ = 122131420.
The previous prime is 122131397. The next prime is 122131447. The reversal of 122131421 is 124131221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116424100 + 5707321 = 10790^2 + 2389^2 .
It is a cyclic number.
It is not a de Polignac number, because 122131421 - 222 = 117937117 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122131421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122131021) 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 as a sum of consecutive naturals, namely, 61065710 + 61065711.
It is an arithmetic number, because the mean of its divisors is an integer number (61065711).
Almost surely, 2122131421 is an apocalyptic number.
It is an amenable number.
122131421 is a deficient number, since it is larger than the sum of its proper divisors (1).
122131421 is an equidigital number, since it uses as much as digits as its factorization.
122131421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96, while the sum is 17.
The square root of 122131421 is about 11051.3085650524. The cubic root of 122131421 is about 496.1455914195.
Adding to 122131421 its reverse (124131221), we get a palindrome (246262642).
The spelling of 122131421 in words is "one hundred twenty-two million, one hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •