Base | Representation |
---|---|
bin | 11100000010101100… |
… | …111101110101001100 |
3 | 2212201102111020011002 |
4 | 130002230331311030 |
5 | 443131142104400 |
6 | 21455444115432 |
7 | 2114104511204 |
oct | 340254756514 |
9 | 85642436132 |
10 | 30110113100 |
11 | 118514126a1 |
12 | 5a03995b78 |
13 | 2abb139a92 |
14 | 1658d0d404 |
15 | bb3629ed5 |
hex | 702b3dd4c |
30110113100 has 72 divisors (see below), whose sum is σ = 67383187200. Its totient is φ = 11672987200.
The previous prime is 30110113093. The next prime is 30110113109. The reversal of 30110113100 is 131101103.
It is a happy number.
It is a super-2 number, since 2×301101131002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30110113109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 382961 + ... + 454839.
It is an arithmetic number, because the mean of its divisors is an integer number (935877600).
Almost surely, 230110113100 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 30110113100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33691593600).
30110113100 is an abundant number, since it is smaller than the sum of its proper divisors (37273074100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30110113100 is a wasteful number, since it uses less digits than its factorization.
30110113100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72023 (or 72016 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 30110113100 its reverse (131101103), we get a palindrome (30241214203).
The spelling of 30110113100 in words is "thirty billion, one hundred ten million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •