Base | Representation |
---|---|
bin | 11100000000011000… |
… | …111100111010000000 |
3 | 2212121201110221001022 |
4 | 130000120330322000 |
5 | 443041223441000 |
6 | 21451540325012 |
7 | 2113123635362 |
oct | 340030747200 |
9 | 85551427038 |
10 | 30071312000 |
11 | 11831520874 |
12 | 59b29a3768 |
13 | 2ab30a2b52 |
14 | 1653accd32 |
15 | bb0013585 |
hex | 70063ce80 |
30071312000 has 128 divisors (see below), whose sum is σ = 75340774080. Its totient is φ = 11935872000.
The previous prime is 30071311973. The next prime is 30071312023. The reversal of 30071312000 is 21317003.
It is a tau number, because it is divible by the number of its divisors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 30071312000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2088827 + ... + 2103173.
Almost surely, 230071312000 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 30071312000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37670387040).
30071312000 is an abundant number, since it is smaller than the sum of its proper divisors (45269462080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30071312000 is a wasteful number, since it uses less digits than its factorization.
30071312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14507 (or 14485 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 17.
Adding to 30071312000 its reverse (21317003), we get a palindrome (30092629003).
The spelling of 30071312000 in words is "thirty billion, seventy-one million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •