Base | Representation |
---|---|
bin | 111001011101… |
… | …0110101111101 |
3 | 2002200112022221 |
4 | 1302322311331 |
5 | 30203003222 |
6 | 2553405341 |
7 | 514030156 |
oct | 162726575 |
9 | 62615287 |
10 | 30125437 |
11 | 16006761 |
12 | a109851 |
13 | 631a104 |
14 | 400292d |
15 | 29a10c7 |
hex | 1cbad7d |
30125437 has 8 divisors (see below), whose sum is σ = 31104216. Its totient is φ = 29155392.
The previous prime is 30125429. The next prime is 30125453. The reversal of 30125437 is 73452103.
It can be written as a sum of positive squares in 4 ways, for example, as 23097636 + 7027801 = 4806^2 + 2651^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30125437 - 23 = 30125429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30125467) 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 7 ways as a sum of consecutive naturals, for example, 5223 + ... + 9355.
It is an arithmetic number, because the mean of its divisors is an integer number (3888027).
Almost surely, 230125437 is an apocalyptic number.
30125437 is a gapful number since it is divisible by the number (37) formed by its first and last digit.
It is an amenable number.
30125437 is a deficient number, since it is larger than the sum of its proper divisors (978779).
30125437 is a wasteful number, since it uses less digits than its factorization.
30125437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4367.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 30125437 is about 5488.6644094898. The cubic root of 30125437 is about 311.1557172106.
The spelling of 30125437 in words is "thirty million, one hundred twenty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •