Base | Representation |
---|---|
bin | 1111100110111… |
… | …11100110101110 |
3 | 100010101101222002 |
4 | 13303133212232 |
5 | 232010024220 |
6 | 20554252302 |
7 | 3146652155 |
oct | 763374656 |
9 | 303341862 |
10 | 130939310 |
11 | 67a03707 |
12 | 37a27092 |
13 | 211871a8 |
14 | 1356659c |
15 | b766c75 |
hex | 7cdf9ae |
130939310 has 8 divisors (see below), whose sum is σ = 235690776. Its totient is φ = 52375720.
The previous prime is 130939307. The next prime is 130939313. The reversal of 130939310 is 13939031.
It is an interprime number because it is at equal distance from previous prime (130939307) and next prime (130939313).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1309393102 = 34290205806552200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130939313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6546956 + ... + 6546975.
It is an arithmetic number, because the mean of its divisors is an integer number (29461347).
Almost surely, 2130939310 is an apocalyptic number.
130939310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130939310 is a deficient number, since it is larger than the sum of its proper divisors (104751466).
130939310 is a wasteful number, since it uses less digits than its factorization.
130939310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13093938.
The product of its (nonzero) digits is 2187, while the sum is 29.
The square root of 130939310 is about 11442.8715801585. The cubic root of 130939310 is about 507.7968657940.
The spelling of 130939310 in words is "one hundred thirty million, nine hundred thirty-nine thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •