Base | Representation |
---|---|
bin | 111101000011010100… |
… | …1010110000001101111 |
3 | 110112102010211200022012 |
4 | 1322012221112001233 |
5 | 4122002122111301 |
6 | 140121415311435 |
7 | 12320656434401 |
oct | 1720651260157 |
9 | 415363750265 |
10 | 131108003951 |
11 | 5066a060981 |
12 | 214ab97b57b |
13 | c4955c8682 |
14 | 64ba6ccb71 |
15 | 362527aebb |
hex | 1e86a5606f |
131108003951 has 2 divisors, whose sum is σ = 131108003952. Its totient is φ = 131108003950.
The previous prime is 131108003927. The next prime is 131108003963. The reversal of 131108003951 is 159300801131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131108003951 is a prime.
It is a super-2 number, since 2×1311080039512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131108008951) 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, 65554001975 + 65554001976.
It is an arithmetic number, because the mean of its divisors is an integer number (65554001976).
Almost surely, 2131108003951 is an apocalyptic number.
131108003951 is a deficient number, since it is larger than the sum of its proper divisors (1).
131108003951 is an equidigital number, since it uses as much as digits as its factorization.
131108003951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 32.
The spelling of 131108003951 in words is "one hundred thirty-one billion, one hundred eight million, three thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •