Base | Representation |
---|---|
bin | 11100001011001100… |
… | …101100000011111010 |
3 | 2220002100200200102110 |
4 | 130023030230003322 |
5 | 443424134143100 |
6 | 21521535113150 |
7 | 2120455153002 |
oct | 341314540372 |
9 | 86070620373 |
10 | 30252646650 |
11 | 11914915216 |
12 | 5a436727b6 |
13 | 2b11823365 |
14 | 166dc13002 |
15 | bc0dd2250 |
hex | 70b32c0fa |
30252646650 has 96 divisors (see below), whose sum is σ = 79840425600. Its totient is φ = 7554539520.
The previous prime is 30252646643. The next prime is 30252646673. The reversal of 30252646650 is 5664625203.
It is a junction number, because it is equal to n+sod(n) for n = 30252646599 and 30252646608.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 477642 + ... + 537258.
It is an arithmetic number, because the mean of its divisors is an integer number (831671100).
Almost surely, 230252646650 is an apocalyptic number.
30252646650 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 30252646650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39920212800).
30252646650 is an abundant number, since it is smaller than the sum of its proper divisors (49587778950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30252646650 is a wasteful number, since it uses less digits than its factorization.
30252646650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59848 (or 59843 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 39.
The spelling of 30252646650 in words is "thirty billion, two hundred fifty-two million, six hundred forty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •