Base | Representation |
---|---|
bin | 111001011101… |
… | …0100111000001 |
3 | 2002200111000112 |
4 | 1302322213001 |
5 | 30202440411 |
6 | 2553401105 |
7 | 514024322 |
oct | 162724701 |
9 | 62614015 |
10 | 30124481 |
11 | 16005a72 |
12 | a109195 |
13 | 631984a |
14 | 4002449 |
15 | 29a0b8b |
hex | 1cba9c1 |
30124481 has 4 divisors (see below), whose sum is σ = 31710000. Its totient is φ = 28538964.
The previous prime is 30124477. The next prime is 30124483. The reversal of 30124481 is 18442103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30124481 - 22 = 30124477 is a prime.
It is a super-2 number, since 2×301244812 = 1814968711038722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30124483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 792731 + ... + 792768.
It is an arithmetic number, because the mean of its divisors is an integer number (7927500).
Almost surely, 230124481 is an apocalyptic number.
It is an amenable number.
30124481 is a deficient number, since it is larger than the sum of its proper divisors (1585519).
30124481 is a wasteful number, since it uses less digits than its factorization.
30124481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585518.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 30124481 is about 5488.5773202170. The cubic root of 30124481 is about 311.1524257727.
Adding to 30124481 its reverse (18442103), we get a palindrome (48566584).
The spelling of 30124481 in words is "thirty million, one hundred twenty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •