Base | Representation |
---|---|
bin | 111101010110100100… |
… | …0011101110010111111 |
3 | 110121002010211020220002 |
4 | 1322231020131302333 |
5 | 4124312421241242 |
6 | 140305442544515 |
7 | 12342656640662 |
oct | 1725510356277 |
9 | 417063736802 |
10 | 131753696447 |
11 | 5097058823a |
12 | 2165006813b |
13 | c569301b39 |
14 | 653c36b6d9 |
15 | 3661cc2432 |
hex | 1ead21dcbf |
131753696447 has 2 divisors, whose sum is σ = 131753696448. Its totient is φ = 131753696446.
The previous prime is 131753696401. The next prime is 131753696491. The reversal of 131753696447 is 744696357131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131753696447 - 26 = 131753696383 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131753696392 and 131753696401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131753696047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65876848223 + 65876848224.
It is an arithmetic number, because the mean of its divisors is an integer number (65876848224).
Almost surely, 2131753696447 is an apocalyptic number.
131753696447 is a deficient number, since it is larger than the sum of its proper divisors (1).
131753696447 is an equidigital number, since it uses as much as digits as its factorization.
131753696447 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11430720, while the sum is 56.
The spelling of 131753696447 in words is "one hundred thirty-one billion, seven hundred fifty-three million, six hundred ninety-six thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •