Base | Representation |
---|---|
bin | 1111100010011… |
… | …01001010001110 |
3 | 100002020221010210 |
4 | 13301031022032 |
5 | 231331330340 |
6 | 20533343250 |
7 | 3141603312 |
oct | 761151216 |
9 | 302227123 |
10 | 130339470 |
11 | 67633a78 |
12 | 37797b26 |
13 | 21007161 |
14 | 1344bb42 |
15 | b699180 |
hex | 7c4d28e |
130339470 has 16 divisors (see below), whose sum is σ = 312814800. Its totient is φ = 34757184.
The previous prime is 130339463. The next prime is 130339477. The reversal of 130339470 is 74933031.
It is an interprime number because it is at equal distance from previous prime (130339463) and next prime (130339477).
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 4344649 = 130339470 / (1 + 3 + 0 + 3 + 3 + 9 + 4 + 7 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130339477) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2172295 + ... + 2172354.
It is an arithmetic number, because the mean of its divisors is an integer number (19550925).
Almost surely, 2130339470 is an apocalyptic number.
130339470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130339470 is an abundant number, since it is smaller than the sum of its proper divisors (182475330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130339470 is a wasteful number, since it uses less digits than its factorization.
130339470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4344659.
The product of its (nonzero) digits is 6804, while the sum is 30.
The square root of 130339470 is about 11416.6312894829. The cubic root of 130339470 is about 507.0202638089.
The spelling of 130339470 in words is "one hundred thirty million, three hundred thirty-nine thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •