Base | Representation |
---|---|
bin | 11100000011010110… |
… | …111101001001000000 |
3 | 2212202012012110012220 |
4 | 130003112331021000 |
5 | 443142001322240 |
6 | 21500520051040 |
7 | 2114300204214 |
oct | 340326751100 |
9 | 85665173186 |
10 | 30121120320 |
11 | 11857650575 |
12 | 5a07603a80 |
13 | 2ac04c1c25 |
14 | 165a576944 |
15 | bb45a15d0 |
hex | 7035bd240 |
30121120320 has 224 divisors, whose sum is σ = 97536780288. Its totient is φ = 7873738752.
The previous prime is 30121120313. The next prime is 30121120343. The reversal of 30121120320 is 2302112103.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 30121120320.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14599609 + ... + 14601671.
Almost surely, 230121120320 is an apocalyptic number.
30121120320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30121120320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48768390144).
30121120320 is an abundant number, since it is smaller than the sum of its proper divisors (67415659968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30121120320 is a wasteful number, since it uses less digits than its factorization.
30121120320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2377 (or 2367 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30121120320 its reverse (2302112103), we get a palindrome (32423232423).
The spelling of 30121120320 in words is "thirty billion, one hundred twenty-one million, one hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •