Base | Representation |
---|---|
bin | 111101010011010110… |
… | …0000101010110100101 |
3 | 110120210121102000211121 |
4 | 1322212230011112211 |
5 | 4124102232433442 |
6 | 140251021533541 |
7 | 12340205035402 |
oct | 1724654052645 |
9 | 416717360747 |
10 | 131645592997 |
11 | 50915561546 |
12 | 2161ba142b1 |
13 | c54cab1ab9 |
14 | 652bc6b2a9 |
15 | 365756b967 |
hex | 1ea6b055a5 |
131645592997 has 2 divisors, whose sum is σ = 131645592998. Its totient is φ = 131645592996.
The previous prime is 131645592893. The next prime is 131645593019. The reversal of 131645592997 is 799295546131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131613681796 + 31911201 = 362786^2 + 5649^2 .
It is a cyclic number.
It is not a de Polignac number, because 131645592997 - 215 = 131645560229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131645592097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65822796498 + 65822796499.
It is an arithmetic number, because the mean of its divisors is an integer number (65822796499).
Almost surely, 2131645592997 is an apocalyptic number.
It is an amenable number.
131645592997 is a deficient number, since it is larger than the sum of its proper divisors (1).
131645592997 is an equidigital number, since it uses as much as digits as its factorization.
131645592997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18370800, while the sum is 61.
The spelling of 131645592997 in words is "one hundred thirty-one billion, six hundred forty-five million, five hundred ninety-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •