Base | Representation |
---|---|
bin | 1111100001111… |
… | …11110110001001 |
3 | 100002011011100001 |
4 | 13300333312021 |
5 | 231323104222 |
6 | 20532243001 |
7 | 3141255316 |
oct | 760776611 |
9 | 302134301 |
10 | 130284937 |
11 | 675a7002 |
12 | 37770461 |
13 | 20cb83a3 |
14 | 13435d0d |
15 | b687e27 |
hex | 7c3fd89 |
130284937 has 4 divisors (see below), whose sum is σ = 130586260. Its totient is φ = 129983616.
The previous prime is 130284911. The next prime is 130284941. The reversal of 130284937 is 739482031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25918281 + 104366656 = 5091^2 + 10216^2 .
It is a cyclic number.
It is not a de Polignac number, because 130284937 - 215 = 130252169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130284896 and 130284905.
It is not an unprimeable number, because it can be changed into a prime (130284977) 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 in 3 ways as a sum of consecutive naturals, for example, 150012 + ... + 150877.
It is an arithmetic number, because the mean of its divisors is an integer number (32646565).
Almost surely, 2130284937 is an apocalyptic number.
It is an amenable number.
130284937 is a deficient number, since it is larger than the sum of its proper divisors (301323).
130284937 is an equidigital number, since it uses as much as digits as its factorization.
130284937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301322.
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 130284937 is about 11414.2427256476. The cubic root of 130284937 is about 506.9495428599.
The spelling of 130284937 in words is "one hundred thirty million, two hundred eighty-four thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •