Base | Representation |
---|---|
bin | 111101001001111101… |
… | …0100000100000101111 |
3 | 110112222122201002111011 |
4 | 1322103322200200233 |
5 | 4122431113412101 |
6 | 140155450410051 |
7 | 12326331512332 |
oct | 1722372404057 |
9 | 415878632434 |
10 | 131330607151 |
11 | 50773781a67 |
12 | 21552430927 |
13 | c4cc767c43 |
14 | 64dc0b6619 |
15 | 3639a9c751 |
hex | 1e93ea082f |
131330607151 has 2 divisors, whose sum is σ = 131330607152. Its totient is φ = 131330607150.
The previous prime is 131330607043. The next prime is 131330607157. The reversal of 131330607151 is 151706033131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131330607151 - 29 = 131330606639 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131330607157) 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, 65665303575 + 65665303576.
It is an arithmetic number, because the mean of its divisors is an integer number (65665303576).
Almost surely, 2131330607151 is an apocalyptic number.
131330607151 is a deficient number, since it is larger than the sum of its proper divisors (1).
131330607151 is an equidigital number, since it uses as much as digits as its factorization.
131330607151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 31.
The spelling of 131330607151 in words is "one hundred thirty-one billion, three hundred thirty million, six hundred seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •