Base | Representation |
---|---|
bin | 11100001001010000… |
… | …111011010001111101 |
3 | 2220000002122101021201 |
4 | 130021100323101331 |
5 | 443342333000013 |
6 | 21514415455501 |
7 | 2116612326331 |
oct | 341120732175 |
9 | 86002571251 |
10 | 30220203133 |
11 | 118a857599a |
12 | 5a34827591 |
13 | 2b07ba4103 |
14 | 16697a97c1 |
15 | bbd1243dd |
hex | 70943b47d |
30220203133 has 8 divisors (see below), whose sum is σ = 31814637120. Its totient is φ = 28626158880.
The previous prime is 30220203131. The next prime is 30220203151. The reversal of 30220203133 is 33130202203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30220203133 - 21 = 30220203131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30220203133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30220203131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69048 + ... + 255358.
It is an arithmetic number, because the mean of its divisors is an integer number (3976829640).
Almost surely, 230220203133 is an apocalyptic number.
It is an amenable number.
30220203133 is a deficient number, since it is larger than the sum of its proper divisors (1594433987).
30220203133 is a wasteful number, since it uses less digits than its factorization.
30220203133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194867.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30220203133 its reverse (33130202203), we get a palindrome (63350405336).
The spelling of 30220203133 in words is "thirty billion, two hundred twenty million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •