Base | Representation |
---|---|
bin | 11100001011000100… |
… | …110100011111000000 |
3 | 2220002012210220000000 |
4 | 130023010310133000 |
5 | 443423122142000 |
6 | 21521423000000 |
7 | 2120431502310 |
oct | 341304643700 |
9 | 86065726000 |
10 | 30250584000 |
11 | 1191373654a |
12 | 5a42a39000 |
13 | 2b11280560 |
14 | 166d837440 |
15 | bc0b26000 |
hex | 70b1347c0 |
30250584000 has 1792 divisors, whose sum is σ = 145562726400. Its totient is φ = 6046617600.
The previous prime is 30250583983. The next prime is 30250584029. The reversal of 30250584000 is 48505203.
30250584000 is a `hidden beast` number, since 3 + 0 + 250 + 5 + 8 + 400 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1592135991 + ... + 1592136009.
It is an arithmetic number, because the mean of its divisors is an integer number (81229200).
Almost surely, 230250584000 is an apocalyptic number.
30250584000 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 30250584000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72781363200).
30250584000 is an abundant number, since it is smaller than the sum of its proper divisors (115312142400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30250584000 is an equidigital number, since it uses as much as digits as its factorization.
30250584000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 30250584000 in words is "thirty billion, two hundred fifty million, five hundred eighty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •