Base | Representation |
---|---|
bin | 1111100011101… |
… | …00011011010010 |
3 | 100002120002202200 |
4 | 13301310123102 |
5 | 231402002211 |
6 | 20541024030 |
7 | 3143143236 |
oct | 761643322 |
9 | 302502680 |
10 | 130500306 |
11 | 677338a2 |
12 | 37855016 |
13 | 21062421 |
14 | 134905c6 |
15 | b6cbb56 |
hex | 7c746d2 |
130500306 has 12 divisors (see below), whose sum is σ = 282750702. Its totient is φ = 43500096.
The previous prime is 130500283. The next prime is 130500329. The reversal of 130500306 is 603005031.
130500306 is a `hidden beast` number, since 130 + 500 + 30 + 6 = 666.
It is an interprime number because it is at equal distance from previous prime (130500283) and next prime (130500329).
It can be written as a sum of positive squares in only one way, i.e., 120099681 + 10400625 = 10959^2 + 3225^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 7250017 = 130500306 / (1 + 3 + 0 + 5 + 0 + 0 + 3 + 0 + 6).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3624991 + ... + 3625026.
Almost surely, 2130500306 is an apocalyptic number.
130500306 is an abundant number, since it is smaller than the sum of its proper divisors (152250396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130500306 is a wasteful number, since it uses less digits than its factorization.
130500306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7250025 (or 7250022 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
The square root of 130500306 is about 11423.6730520442. The cubic root of 130500306 is about 507.2287286525.
Adding to 130500306 its reverse (603005031), we get a palindrome (733505337).
The spelling of 130500306 in words is "one hundred thirty million, five hundred thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •