Base | Representation |
---|---|
bin | 111101001101100001… |
… | …1011111100110110011 |
3 | 110120022000010100211202 |
4 | 1322123003133212303 |
5 | 4123202300401001 |
6 | 140215410201415 |
7 | 12332314664156 |
oct | 1723303374663 |
9 | 416260110752 |
10 | 131450403251 |
11 | 50825364602 |
12 | 2158658326b |
13 | c51b5200cb |
14 | 650dd7bc9d |
15 | 364536296b |
hex | 1e9b0df9b3 |
131450403251 has 2 divisors, whose sum is σ = 131450403252. Its totient is φ = 131450403250.
The previous prime is 131450403199. The next prime is 131450403257. The reversal of 131450403251 is 152304054131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131450403251 - 210 = 131450402227 is a prime.
It is a super-2 number, since 2×1314504032512 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131450403257) 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, 65725201625 + 65725201626.
It is an arithmetic number, because the mean of its divisors is an integer number (65725201626).
Almost surely, 2131450403251 is an apocalyptic number.
131450403251 is a deficient number, since it is larger than the sum of its proper divisors (1).
131450403251 is an equidigital number, since it uses as much as digits as its factorization.
131450403251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 131450403251 its reverse (152304054131), we get a palindrome (283754457382).
The spelling of 131450403251 in words is "one hundred thirty-one billion, four hundred fifty million, four hundred three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •