Base | Representation |
---|---|
bin | 11100011010110101… |
… | …100010110101011000 |
3 | 2220202122101101010202 |
4 | 130122311202311120 |
5 | 444443320440000 |
6 | 22003550401332 |
7 | 2130122230211 |
oct | 343265426530 |
9 | 86678341122 |
10 | 30515015000 |
11 | 11a39a26468 |
12 | 5ab7500248 |
13 | 2b53ca65c2 |
14 | 16969cc408 |
15 | bd8e5add5 |
hex | 71ad62d58 |
30515015000 has 80 divisors (see below), whose sum is σ = 72846306720. Its totient is φ = 11975600000.
The previous prime is 30515014997. The next prime is 30515015017. The reversal of 30515015000 is 51051503.
It is a happy number.
It is a super-2 number, since 2×305150150002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 207425 + ... + 322575.
It is an arithmetic number, because the mean of its divisors is an integer number (910578834).
Almost surely, 230515015000 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 30515015000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36423153360).
30515015000 is an abundant number, since it is smaller than the sum of its proper divisors (42331291720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30515015000 is a wasteful number, since it uses less digits than its factorization.
30515015000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115230 (or 115211 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 20.
Adding to 30515015000 its reverse (51051503), we get a palindrome (30566066503).
The spelling of 30515015000 in words is "thirty billion, five hundred fifteen million, fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •