Base | Representation |
---|---|
bin | 11100000100000110… |
… | …001000100111100100 |
3 | 2212210001110210121211 |
4 | 130010012020213210 |
5 | 443203133104400 |
6 | 21502041121204 |
7 | 2114510264662 |
oct | 340406104744 |
9 | 85701423554 |
10 | 30133488100 |
11 | 11863628681 |
12 | 5a0b789204 |
13 | 2ac2c32441 |
14 | 165c075c32 |
15 | bb56e5dba |
hex | 7041889e4 |
30133488100 has 27 divisors (see below), whose sum is σ = 65393436297. Its totient is φ = 12052700880.
The previous prime is 30133488079. The next prime is 30133488101. The reversal of 30133488100 is 188433103.
The square root of 30133488100 is 173590.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10848055716 + 19285432384 = 104154^2 + 138872^2 .
It is a super-2 number, since 2×301334881002 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30133488101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1727221 + ... + 1744579.
Almost surely, 230133488100 is an apocalyptic number.
30133488100 is the 173590-th square number.
It is an amenable number.
30133488100 is an abundant number, since it is smaller than the sum of its proper divisors (35259948197).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30133488100 is an frugal number, since it uses more digits than its factorization.
30133488100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34732 (or 17366 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 30133488100 in words is "thirty billion, one hundred thirty-three million, four hundred eighty-eight thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •