Base | Representation |
---|---|
bin | 11100110001101011… |
… | …100001100100000000 |
3 | 2221202100112110101000 |
4 | 130301223201210000 |
5 | 1001234423424240 |
6 | 22110001012000 |
7 | 2142454625160 |
oct | 346153414400 |
9 | 87670473330 |
10 | 30898264320 |
11 | 121162a0340 |
12 | 5ba3924000 |
13 | 2bb5501751 |
14 | 16d18725a0 |
15 | c0c911430 |
hex | 731ae1900 |
30898264320 has 1152 divisors, whose sum is σ = 144954593280. Its totient is φ = 6033899520.
The previous prime is 30898264283. The next prime is 30898264333. The reversal of 30898264320 is 2346289803.
It is a tau number, because it is divible by the number of its divisors (1152).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 45238699 + ... + 45239381.
It is an arithmetic number, because the mean of its divisors is an integer number (125828640).
Almost surely, 230898264320 is an apocalyptic number.
30898264320 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 30898264320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72477296640).
30898264320 is an abundant number, since it is smaller than the sum of its proper divisors (114056328960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30898264320 is a wasteful number, since it uses less digits than its factorization.
30898264320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 748 (or 728 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 45.
The spelling of 30898264320 in words is "thirty billion, eight hundred ninety-eight million, two hundred sixty-four thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •