Base | Representation |
---|---|
bin | 111100110010001000… |
… | …0111110100010110011 |
3 | 110110220221110112122012 |
4 | 1321210100332202303 |
5 | 4114311441102323 |
6 | 135544252233135 |
7 | 12300453550025 |
oct | 1714420764263 |
9 | 413827415565 |
10 | 130531190963 |
11 | 503a34aa828 |
12 | 2136a76b7ab |
13 | c402c5aa04 |
14 | 6463c60015 |
15 | 35de7dd678 |
hex | 1e6443e8b3 |
130531190963 has 2 divisors, whose sum is σ = 130531190964. Its totient is φ = 130531190962.
The previous prime is 130531190897. The next prime is 130531190989. The reversal of 130531190963 is 369091135031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130531190963 - 28 = 130531190707 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130531190963.
It is not a weakly prime, because it can be changed into another prime (130531190663) 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, 65265595481 + 65265595482.
It is an arithmetic number, because the mean of its divisors is an integer number (65265595482).
Almost surely, 2130531190963 is an apocalyptic number.
130531190963 is a deficient number, since it is larger than the sum of its proper divisors (1).
130531190963 is an equidigital number, since it uses as much as digits as its factorization.
130531190963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65610, while the sum is 41.
The spelling of 130531190963 in words is "one hundred thirty billion, five hundred thirty-one million, one hundred ninety thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •