Base | Representation |
---|---|
bin | 11100001110000010… |
… | …000110010011011000 |
3 | 2220012200011202101010 |
4 | 130032002012103120 |
5 | 444023322432300 |
6 | 21530354253520 |
7 | 2121603316632 |
oct | 341602062330 |
9 | 86180152333 |
10 | 30300202200 |
11 | 11939746424 |
12 | 5a575872a0 |
13 | 2b1b633c38 |
14 | 1676271a52 |
15 | bc5177a50 |
hex | 70e0864d8 |
30300202200 has 96 divisors (see below), whose sum is σ = 94069425600. Its totient is φ = 8068114560.
The previous prime is 30300202169. The next prime is 30300202213. The reversal of 30300202200 is 220200303.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 372831 + ... + 446769.
It is an arithmetic number, because the mean of its divisors is an integer number (979889850).
Almost surely, 230300202200 is an apocalyptic number.
30300202200 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 30300202200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47034712800).
30300202200 is an abundant number, since it is smaller than the sum of its proper divisors (63769223400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30300202200 is a wasteful number, since it uses less digits than its factorization.
30300202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74641 (or 74632 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 12.
Adding to 30300202200 its reverse (220200303), we get a palindrome (30520402503).
The spelling of 30300202200 in words is "thirty billion, three hundred million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •