Base | Representation |
---|---|
bin | 11011111100111001… |
… | …110111001000101010 |
3 | 2212110122102202011120 |
4 | 123330321313020222 |
5 | 442431241032000 |
6 | 21442051040110 |
7 | 2111513563554 |
oct | 337471671052 |
9 | 85418382146 |
10 | 30012830250 |
11 | 11801507647 |
12 | 59972a0036 |
13 | 2aa3c37c70 |
14 | 164a0284d4 |
15 | ba9d106a0 |
hex | 6fce7722a |
30012830250 has 128 divisors (see below), whose sum is σ = 82643258880. Its totient is φ = 7207488000.
The previous prime is 30012830233. The next prime is 30012830257. The reversal of 30012830250 is 5203821003.
It is a self number, because there is not a number n which added to its sum of digits gives 30012830250.
It is not an unprimeable number, because it can be changed into a prime (30012830257) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 362211 + ... + 437289.
It is an arithmetic number, because the mean of its divisors is an integer number (645650460).
Almost surely, 230012830250 is an apocalyptic number.
30012830250 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30012830250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41321629440).
30012830250 is an abundant number, since it is smaller than the sum of its proper divisors (52630428630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30012830250 is a wasteful number, since it uses less digits than its factorization.
30012830250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75153 (or 75143 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The spelling of 30012830250 in words is "thirty billion, twelve million, eight hundred thirty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •