Base | Representation |
---|---|
bin | 1111100110000… |
… | …00001101000111 |
3 | 100010010212112120 |
4 | 13303000031013 |
5 | 231441420240 |
6 | 20551421023 |
7 | 3145605201 |
oct | 763001507 |
9 | 303125476 |
10 | 130810695 |
11 | 67926014 |
12 | 37984773 |
13 | 211407a2 |
14 | 13531771 |
15 | b73dad0 |
hex | 7cc0347 |
130810695 has 8 divisors (see below), whose sum is σ = 209297136. Its totient is φ = 69765696.
The previous prime is 130810681. The next prime is 130810709. The reversal of 130810695 is 596018031.
It is an interprime number because it is at equal distance from previous prime (130810681) and next prime (130810709).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130810695 - 24 = 130810679 is a prime.
It is a super-2 number, since 2×1308106952 = 34222875852766050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4360342 + ... + 4360371.
It is an arithmetic number, because the mean of its divisors is an integer number (26162142).
Almost surely, 2130810695 is an apocalyptic number.
130810695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130810695 is a deficient number, since it is larger than the sum of its proper divisors (78486441).
130810695 is an equidigital number, since it uses as much as digits as its factorization.
130810695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8720721.
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 130810695 is about 11437.2503251437. The cubic root of 130810695 is about 507.6305503480.
The spelling of 130810695 in words is "one hundred thirty million, eight hundred ten thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •