Base | Representation |
---|---|
bin | 111001010100… |
… | …1111010111100 |
3 | 2002120000020210 |
4 | 1302221322330 |
5 | 30143243444 |
6 | 2552112420 |
7 | 513321120 |
oct | 162517274 |
9 | 62500223 |
10 | 30056124 |
11 | 15a6967a |
12 | a095710 |
13 | 62c46b7 |
14 | 3dc5580 |
15 | 298a7b9 |
hex | 1ca9ebc |
30056124 has 96 divisors (see below), whose sum is σ = 85671936. Its totient is φ = 8015040.
The previous prime is 30056123. The next prime is 30056189. The reversal of 30056124 is 42165003.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 30056124.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30056123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90639 + ... + 90969.
It is an arithmetic number, because the mean of its divisors is an integer number (892416).
Almost surely, 230056124 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30056124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42835968).
30056124 is an abundant number, since it is smaller than the sum of its proper divisors (55615812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30056124 is a wasteful number, since it uses less digits than its factorization.
30056124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415 (or 413 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 30056124 is about 5482.3465778807. The cubic root of 30056124 is about 310.9168969068.
The spelling of 30056124 in words is "thirty million, fifty-six thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •