Base | Representation |
---|---|
bin | 111101000000000110… |
… | …1010100110011100011 |
3 | 110112010121121021201121 |
4 | 1322000031110303203 |
5 | 4121241444324434 |
6 | 140103000313111 |
7 | 12315205406323 |
oct | 1720015246343 |
9 | 415117537647 |
10 | 130999995619 |
11 | 5061409a699 |
12 | 2147b772797 |
13 | c47910ca0c |
14 | 64aa215283 |
15 | 361aa437b4 |
hex | 1e80354ce3 |
130999995619 has 2 divisors, whose sum is σ = 130999995620. Its totient is φ = 130999995618.
The previous prime is 130999995611. The next prime is 130999995667. The reversal of 130999995619 is 916599999031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130999995619 - 23 = 130999995611 is a prime.
It is a super-2 number, since 2×1309999956192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130999995611) 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, 65499997809 + 65499997810.
It is an arithmetic number, because the mean of its divisors is an integer number (65499997810).
Almost surely, 2130999995619 is an apocalyptic number.
130999995619 is a deficient number, since it is larger than the sum of its proper divisors (1).
130999995619 is an equidigital number, since it uses as much as digits as its factorization.
130999995619 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47829690, while the sum is 70.
The spelling of 130999995619 in words is "one hundred thirty billion, nine hundred ninety-nine million, nine hundred ninety-five thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •