Base | Representation |
---|---|
bin | 11100000100000001… |
… | …101001000010111000 |
3 | 2212202222020221211220 |
4 | 130010001221002320 |
5 | 443202332411300 |
6 | 21501555552040 |
7 | 2114464260606 |
oct | 340401510270 |
9 | 85688227756 |
10 | 30132310200 |
11 | 118629a3703 |
12 | 5a0b2bb620 |
13 | 2ac290c265 |
14 | 165bc4a876 |
15 | bb5561da0 |
hex | 7040690b8 |
30132310200 has 96 divisors (see below), whose sum is σ = 95582572800. Its totient is φ = 7848408960.
The previous prime is 30132310199. The next prime is 30132310211. The reversal of 30132310200 is 201323103.
It is a super-2 number, since 2×301323102002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 30132310200.
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, 558160 + ... + 609759.
It is an arithmetic number, because the mean of its divisors is an integer number (995651800).
Almost surely, 230132310200 is an apocalyptic number.
30132310200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30132310200 is an abundant number, since it is smaller than the sum of its proper divisors (65450262600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30132310200 is a wasteful number, since it uses less digits than its factorization.
30132310200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1167981 (or 1167972 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 30132310200 its reverse (201323103), we get a palindrome (30333633303).
The spelling of 30132310200 in words is "thirty billion, one hundred thirty-two million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •