Base | Representation |
---|---|
bin | 111001110101… |
… | …1100100111010 |
3 | 2010001200011000 |
4 | 1303223210322 |
5 | 30230400200 |
6 | 3001545430 |
7 | 515521140 |
oct | 163534472 |
9 | 63050130 |
10 | 30325050 |
11 | 16132728 |
12 | a1a5276 |
13 | 6389c22 |
14 | 4055590 |
15 | 29e0300 |
hex | 1ceb93a |
30325050 has 96 divisors (see below), whose sum is σ = 95529600. Its totient is φ = 6929280.
The previous prime is 30325049. The next prime is 30325073. The reversal of 30325050 is 5052303.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an alternating number because its digits alternate between odd and even.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7846 + ... + 11054.
It is an arithmetic number, because the mean of its divisors is an integer number (995100).
Almost surely, 230325050 is an apocalyptic number.
30325050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30325050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47764800).
30325050 is an abundant number, since it is smaller than the sum of its proper divisors (65204550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30325050 is a wasteful number, since it uses less digits than its factorization.
30325050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3237 (or 3226 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 18.
The square root of 30325050 is about 5506.8185007316. The cubic root of 30325050 is about 311.8414505084.
Adding to 30325050 its reverse (5052303), we get a palindrome (35377353).
The spelling of 30325050 in words is "thirty million, three hundred twenty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •