Base | Representation |
---|---|
bin | 111010101010… |
… | …1110001110010 |
3 | 2010212202212010 |
4 | 1311111301302 |
5 | 30333310200 |
6 | 3015143350 |
7 | 522312306 |
oct | 165256162 |
9 | 63782763 |
10 | 30760050 |
11 | 163aa532 |
12 | a374b56 |
13 | 64acc19 |
14 | 4129d06 |
15 | 2a79150 |
hex | 1d55c72 |
30760050 has 96 divisors (see below), whose sum is σ = 82494720. Its totient is φ = 7560000.
The previous prime is 30760003. The next prime is 30760057. The reversal of 30760050 is 5006703.
It is a junction number, because it is equal to n+sod(n) for n = 30759999 and 30760026.
It is not an unprimeable number, because it can be changed into a prime (30760057) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 122425 + ... + 122675.
It is an arithmetic number, because the mean of its divisors is an integer number (859320).
Almost surely, 230760050 is an apocalyptic number.
30760050 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 30760050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41247360).
30760050 is an abundant number, since it is smaller than the sum of its proper divisors (51734670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30760050 is a wasteful number, since it uses less digits than its factorization.
30760050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328 (or 323 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 21.
The square root of 30760050 is about 5546.1743571583. The cubic root of 30760050 is about 313.3254550104.
Adding to 30760050 its reverse (5006703), we get a palindrome (35766753).
The spelling of 30760050 in words is "thirty million, seven hundred sixty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •