Base | Representation |
---|---|
bin | 1111100001010… |
… | …10001111110111 |
3 | 100001222122222112 |
4 | 13300222033313 |
5 | 231312241341 |
6 | 20530321235 |
7 | 3140436356 |
oct | 760521767 |
9 | 301878875 |
10 | 130196471 |
11 | 67546599 |
12 | 3772921b |
13 | 20c87042 |
14 | 1341199d |
15 | b66baeb |
hex | 7c2a3f7 |
130196471 has 2 divisors, whose sum is σ = 130196472. Its totient is φ = 130196470.
The previous prime is 130196459. The next prime is 130196483. The reversal of 130196471 is 174691031.
It is a balanced prime because it is at equal distance from previous prime (130196459) and next prime (130196483).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130196471 is a prime.
It is a super-3 number, since 3×1301964713 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130196441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65098235 + 65098236.
It is an arithmetic number, because the mean of its divisors is an integer number (65098236).
Almost surely, 2130196471 is an apocalyptic number.
130196471 is a deficient number, since it is larger than the sum of its proper divisors (1).
130196471 is an equidigital number, since it uses as much as digits as its factorization.
130196471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 130196471 is about 11410.3668214479. The cubic root of 130196471 is about 506.8347740208.
It can be divided in two parts, 130196 and 471, that multiplied together give a palindrome (61322316).
The spelling of 130196471 in words is "one hundred thirty million, one hundred ninety-six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •