Base | Representation |
---|---|
bin | 111101001000110000… |
… | …0001110011011110011 |
3 | 110112212211121022110002 |
4 | 1322101200032123303 |
5 | 4122340240203211 |
6 | 140151443500215 |
7 | 12325330654214 |
oct | 1722140163363 |
9 | 415784538402 |
10 | 131290162931 |
11 | 50752968694 |
12 | 2154098766b |
13 | c4c4277155 |
14 | 64d698940b |
15 | 363625e03b |
hex | 1e9180e6f3 |
131290162931 has 2 divisors, whose sum is σ = 131290162932. Its totient is φ = 131290162930.
The previous prime is 131290162921. The next prime is 131290162999. The reversal of 131290162931 is 139261092131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131290162931 - 26 = 131290162867 is a prime.
It is a super-2 number, since 2×1312901629312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131290162901) 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, 65645081465 + 65645081466.
It is an arithmetic number, because the mean of its divisors is an integer number (65645081466).
Almost surely, 2131290162931 is an apocalyptic number.
131290162931 is a deficient number, since it is larger than the sum of its proper divisors (1).
131290162931 is an equidigital number, since it uses as much as digits as its factorization.
131290162931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 38.
The spelling of 131290162931 in words is "one hundred thirty-one billion, two hundred ninety million, one hundred sixty-two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •