Base | Representation |
---|---|
bin | 11100001110101011… |
… | …110010010001011000 |
3 | 2220020102201221202212 |
4 | 130032223302101120 |
5 | 444034122131300 |
6 | 21531424414252 |
7 | 2122065232661 |
oct | 341653622130 |
9 | 86212657685 |
10 | 30311130200 |
11 | 1194492a82a |
12 | 5a5b177388 |
13 | 2b2098c000 |
14 | 16778b8368 |
15 | bc60d5935 |
hex | 70eaf2458 |
30311130200 has 192 divisors, whose sum is σ = 77212245600. Its totient is φ = 11064768000.
The previous prime is 30311130197. The next prime is 30311130209. The reversal of 30311130200 is 203111303.
It is a super-2 number, since 2×303111302002 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30311130209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 44379059 + ... + 44379741.
Almost surely, 230311130200 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 30311130200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38606122800).
30311130200 is an abundant number, since it is smaller than the sum of its proper divisors (46901115400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30311130200 is a wasteful number, since it uses less digits than its factorization.
30311130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839 (or 804 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 30311130200 its reverse (203111303), we get a palindrome (30514241503).
The spelling of 30311130200 in words is "thirty billion, three hundred eleven million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.261 sec. • engine limits •