Base | Representation |
---|---|
bin | 111100101100001010… |
… | …1000101001000110101 |
3 | 110110101222122201220021 |
4 | 1321120111011020311 |
5 | 4113404210034312 |
6 | 135512340205141 |
7 | 12262502465611 |
oct | 1713025051065 |
9 | 413358581807 |
10 | 130330939957 |
11 | 50300466229 |
12 | 213136997b1 |
13 | c3a06163aa |
14 | 6445414341 |
15 | 35cbe34c07 |
hex | 1e58545235 |
130330939957 has 2 divisors, whose sum is σ = 130330939958. Its totient is φ = 130330939956.
The previous prime is 130330939919. The next prime is 130330939979. The reversal of 130330939957 is 759939033031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128560970916 + 1769969041 = 358554^2 + 42071^2 .
It is a cyclic number.
It is not a de Polignac number, because 130330939957 - 211 = 130330937909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130330939457) 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, 65165469978 + 65165469979.
It is an arithmetic number, because the mean of its divisors is an integer number (65165469979).
Almost surely, 2130330939957 is an apocalyptic number.
It is an amenable number.
130330939957 is a deficient number, since it is larger than the sum of its proper divisors (1).
130330939957 is an equidigital number, since it uses as much as digits as its factorization.
130330939957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2066715, while the sum is 52.
The spelling of 130330939957 in words is "one hundred thirty billion, three hundred thirty million, nine hundred thirty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •