Base | Representation |
---|---|
bin | 11100100110000110… |
… | …100011100111000000 |
3 | 2221020211001000202002 |
4 | 130212012203213000 |
5 | 1000340212232000 |
6 | 22034421443132 |
7 | 2134605616646 |
oct | 344606434700 |
9 | 87224030662 |
10 | 30704024000 |
11 | 12026691751 |
12 | 5b4a8704a8 |
13 | 2b841b2c50 |
14 | 16b3b4d196 |
15 | bea8438d5 |
hex | 7261a39c0 |
30704024000 has 224 divisors, whose sum is σ = 82897528896. Its totient is φ = 11197132800.
The previous prime is 30704023927. The next prime is 30704024009. The reversal of 30704024000 is 42040703.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30704024009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8630222 + ... + 8633778.
It is an arithmetic number, because the mean of its divisors is an integer number (370078254).
Almost surely, 230704024000 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 30704024000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41448764448).
30704024000 is an abundant number, since it is smaller than the sum of its proper divisors (52193504896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30704024000 is a wasteful number, since it uses less digits than its factorization.
30704024000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3680 (or 3660 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 20.
Adding to 30704024000 its reverse (42040703), we get a palindrome (30746064703).
The spelling of 30704024000 in words is "thirty billion, seven hundred four million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •