Base | Representation |
---|---|
bin | 111101001111011111… |
… | …0100111101010000011 |
3 | 110120110120222221011101 |
4 | 1322132332213222003 |
5 | 4123321123444441 |
6 | 140230121155231 |
7 | 12334044355504 |
oct | 1723676475203 |
9 | 416416887141 |
10 | 131516234371 |
11 | 50859538495 |
12 | 215a462bb17 |
13 | c52c05c232 |
14 | 65189d6bab |
15 | 364b018231 |
hex | 1e9efa7a83 |
131516234371 has 2 divisors, whose sum is σ = 131516234372. Its totient is φ = 131516234370.
The previous prime is 131516234347. The next prime is 131516234383. The reversal of 131516234371 is 173432615131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131516234371 - 221 = 131514137219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131516234371.
It is not a weakly prime, because it can be changed into another prime (131516234321) 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, 65758117185 + 65758117186.
It is an arithmetic number, because the mean of its divisors is an integer number (65758117186).
Almost surely, 2131516234371 is an apocalyptic number.
131516234371 is a deficient number, since it is larger than the sum of its proper divisors (1).
131516234371 is an equidigital number, since it uses as much as digits as its factorization.
131516234371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45360, while the sum is 37.
The spelling of 131516234371 in words is "one hundred thirty-one billion, five hundred sixteen million, two hundred thirty-four thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •