Base | Representation |
---|---|
bin | 11100001111100001… |
… | …011101010010000000 |
3 | 2220021102012202220120 |
4 | 130033201131102000 |
5 | 444101222400000 |
6 | 21533050140240 |
7 | 2122325642544 |
oct | 341741352200 |
9 | 86242182816 |
10 | 30325200000 |
11 | 1195186a667 |
12 | 5a63a21680 |
13 | 2b23877134 |
14 | 16796dba24 |
15 | bc74646a0 |
hex | 70f85d480 |
30325200000 has 384 divisors, whose sum is σ = 103555247040. Its totient is φ = 7856640000.
The previous prime is 30325199977. The next prime is 30325200007. The reversal of 30325200000 is 252303.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (30325200007) 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, 44399659 + ... + 44400341.
Almost surely, 230325200000 is an apocalyptic number.
30325200000 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 30325200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51777623520).
30325200000 is an abundant number, since it is smaller than the sum of its proper divisors (73230047040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30325200000 is an frugal number, since it uses more digits than its factorization.
30325200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762 (or 730 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 15.
Adding to 30325200000 its reverse (252303), we get a palindrome (30325452303).
The spelling of 30325200000 in words is "thirty billion, three hundred twenty-five million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •