Base | Representation |
---|---|
bin | 11100010010111000… |
… | …111111111100000000 |
3 | 2220102100112102100000 |
4 | 130102320333330000 |
5 | 444210203443122 |
6 | 21542425200000 |
7 | 2123613133221 |
oct | 342270777400 |
9 | 86370472300 |
10 | 30381702912 |
11 | 11980752090 |
12 | 5a7a930000 |
13 | 2b3249b402 |
14 | 1683009248 |
15 | bcc3c60ac |
hex | 712e3ff00 |
30381702912 has 432 divisors, whose sum is σ = 102584926080. Its totient is φ = 8883302400.
The previous prime is 30381702887. The next prime is 30381702913. The reversal of 30381702912 is 21920718303.
It is a tau number, because it is divible by the number of its divisors (432).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30381702913) 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, 19843587 + ... + 19845117.
Almost surely, 230381702912 is an apocalyptic number.
30381702912 is a gapful number since it is divisible by the number (32) 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 30381702912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51292463040).
30381702912 is an abundant number, since it is smaller than the sum of its proper divisors (72203223168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30381702912 is a wasteful number, since it uses less digits than its factorization.
30381702912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1602 (or 1576 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 30381702912 in words is "thirty billion, three hundred eighty-one million, seven hundred two thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •