Base | Representation |
---|---|
bin | 11110110110000111… |
… | …001101001001000101 |
3 | 10011111012100002002001 |
4 | 132312013031021011 |
5 | 1020312222110341 |
6 | 23114250545301 |
7 | 2251514213566 |
oct | 366607151105 |
9 | 104435302061 |
10 | 33120113221 |
11 | 130564932a8 |
12 | 6503a38231 |
13 | 317a912c40 |
14 | 186299a16d |
15 | cdc9e6d31 |
hex | 7b61cd245 |
33120113221 has 4 divisors (see below), whose sum is σ = 35667814252. Its totient is φ = 30572412192.
The previous prime is 33120113161. The next prime is 33120113233. The reversal of 33120113221 is 12231102133.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 12231102133 = 2897 ⋅4221989.
It can be written as a sum of positive squares in 2 ways, for example, as 8361090721 + 24759022500 = 91439^2 + 157350^2 .
It is a cyclic number.
It is not a de Polignac number, because 33120113221 - 29 = 33120112709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33120113021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1273850496 + ... + 1273850521.
It is an arithmetic number, because the mean of its divisors is an integer number (8916953563).
Almost surely, 233120113221 is an apocalyptic number.
It is an amenable number.
33120113221 is a deficient number, since it is larger than the sum of its proper divisors (2547701031).
33120113221 is a wasteful number, since it uses less digits than its factorization.
33120113221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2547701030.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 33120113221 its reverse (12231102133), we get a palindrome (45351215354).
The spelling of 33120113221 in words is "thirty-three billion, one hundred twenty million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •