Base | Representation |
---|---|
bin | 1111101010101… |
… | …01001110110101 |
3 | 100011021212212111 |
4 | 13311111032311 |
5 | 232120433414 |
6 | 21012451021 |
7 | 3154026631 |
oct | 765251665 |
9 | 304255774 |
10 | 131421109 |
11 | 68202696 |
12 | 38019a71 |
13 | 212c5591 |
14 | 1364ddc1 |
15 | b80e8c4 |
hex | 7d553b5 |
131421109 has 2 divisors, whose sum is σ = 131421110. Its totient is φ = 131421108.
The previous prime is 131421091. The next prime is 131421197. The reversal of 131421109 is 901124131.
Together with previous prime (131421091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113358609 + 18062500 = 10647^2 + 4250^2 .
It is a cyclic number.
It is not a de Polignac number, because 131421109 - 27 = 131420981 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 131421109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131421809) 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, 65710554 + 65710555.
It is an arithmetic number, because the mean of its divisors is an integer number (65710555).
Almost surely, 2131421109 is an apocalyptic number.
It is an amenable number.
131421109 is a deficient number, since it is larger than the sum of its proper divisors (1).
131421109 is an equidigital number, since it uses as much as digits as its factorization.
131421109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The square root of 131421109 is about 11463.9046140484. The cubic root of 131421109 is about 508.4189263975.
The spelling of 131421109 in words is "one hundred thirty-one million, four hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •