Base | Representation |
---|---|
bin | 111101000110000110… |
… | …0101000101010100101 |
3 | 110112122122002112212211 |
4 | 1322030030220222211 |
5 | 4122144443011123 |
6 | 140134543443421 |
7 | 12323200205236 |
oct | 1721414505245 |
9 | 415578075784 |
10 | 131201141413 |
11 | 50707695491 |
12 | 21516bb6571 |
13 | c4ab9a86b4 |
14 | 64c8c1508d |
15 | 362d52740d |
hex | 1e8c328aa5 |
131201141413 has 2 divisors, whose sum is σ = 131201141414. Its totient is φ = 131201141412.
The previous prime is 131201141353. The next prime is 131201141479. The reversal of 131201141413 is 314141102131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84738045604 + 46463095809 = 291098^2 + 215553^2 .
It is a cyclic number.
It is not a de Polignac number, because 131201141413 - 221 = 131199044261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131207141413) 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, 65600570706 + 65600570707.
It is an arithmetic number, because the mean of its divisors is an integer number (65600570707).
Almost surely, 2131201141413 is an apocalyptic number.
It is an amenable number.
131201141413 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201141413 is an equidigital number, since it uses as much as digits as its factorization.
131201141413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 131201141413 its reverse (314141102131), we get a palindrome (445342243544).
The spelling of 131201141413 in words is "one hundred thirty-one billion, two hundred one million, one hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •