Base | Representation |
---|---|
bin | 111001100110… |
… | …1010100011001 |
3 | 2002211101010202 |
4 | 1303031110121 |
5 | 30212413423 |
6 | 2555151545 |
7 | 514463615 |
oct | 163152431 |
9 | 62741122 |
10 | 30201113 |
11 | 160585a8 |
12 | a1455b5 |
13 | 63456a7 |
14 | 4022345 |
15 | 29b8728 |
hex | 1ccd519 |
30201113 has 4 divisors (see below), whose sum is σ = 30336768. Its totient is φ = 30065460.
The previous prime is 30201091. The next prime is 30201137. The reversal of 30201113 is 31110203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30201113 - 212 = 30197017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30201094 and 30201103.
It is not an unprimeable number, because it can be changed into a prime (30201173) 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 3 ways as a sum of consecutive naturals, for example, 67493 + ... + 67938.
It is an arithmetic number, because the mean of its divisors is an integer number (7584192).
Almost surely, 230201113 is an apocalyptic number.
It is an amenable number.
30201113 is a deficient number, since it is larger than the sum of its proper divisors (135655).
30201113 is a wasteful number, since it uses less digits than its factorization.
30201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135654.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 30201113 is about 5495.5539302240. The cubic root of 30201113 is about 311.4160435099.
Adding to 30201113 its reverse (31110203), we get a palindrome (61311316).
The spelling of 30201113 in words is "thirty million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •