Base | Representation |
---|---|
bin | 111101001111001001… |
… | …1110110000110101111 |
3 | 110120102210220020210122 |
4 | 1322132103312012233 |
5 | 4123310241140414 |
6 | 140225040555155 |
7 | 12333550144505 |
oct | 1723623660657 |
9 | 416383806718 |
10 | 131505021359 |
11 | 50853179a38 |
12 | 215a0922abb |
13 | c52993450a |
14 | 6517318675 |
15 | 364a050b8e |
hex | 1e9e4f61af |
131505021359 has 2 divisors, whose sum is σ = 131505021360. Its totient is φ = 131505021358.
The previous prime is 131505021257. The next prime is 131505021457. The reversal of 131505021359 is 953120505131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131505021359 - 212 = 131505017263 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131505024359) 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, 65752510679 + 65752510680.
It is an arithmetic number, because the mean of its divisors is an integer number (65752510680).
Almost surely, 2131505021359 is an apocalyptic number.
131505021359 is a deficient number, since it is larger than the sum of its proper divisors (1).
131505021359 is an equidigital number, since it uses as much as digits as its factorization.
131505021359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20250, while the sum is 35.
The spelling of 131505021359 in words is "one hundred thirty-one billion, five hundred five million, twenty-one thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •