Base | Representation |
---|---|
bin | 111101000001101100… |
… | …0010010011001110001 |
3 | 110112021022201101210121 |
4 | 1322003120102121301 |
5 | 4121344104413014 |
6 | 140112140530241 |
7 | 12316422554143 |
oct | 1720330223161 |
9 | 415238641717 |
10 | 131053201009 |
11 | 5064112a695 |
12 | 21495550981 |
13 | c48714b0b3 |
14 | 64b3304c93 |
15 | 3620553124 |
hex | 1e83612671 |
131053201009 has 2 divisors, whose sum is σ = 131053201010. Its totient is φ = 131053201008.
The previous prime is 131053200961. The next prime is 131053201039. The reversal of 131053201009 is 900102350131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91187088784 + 39866112225 = 301972^2 + 199665^2 .
It is a cyclic number.
It is not a de Polignac number, because 131053201009 - 27 = 131053200881 is a prime.
It is not a weakly prime, because it can be changed into another prime (131053201039) 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, 65526600504 + 65526600505.
It is an arithmetic number, because the mean of its divisors is an integer number (65526600505).
Almost surely, 2131053201009 is an apocalyptic number.
It is an amenable number.
131053201009 is a deficient number, since it is larger than the sum of its proper divisors (1).
131053201009 is an equidigital number, since it uses as much as digits as its factorization.
131053201009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
The spelling of 131053201009 in words is "one hundred thirty-one billion, fifty-three million, two hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •