Base | Representation |
---|---|
bin | 11110110000010001… |
… | …110001101110011101 |
3 | 10011020101010122111010 |
4 | 132300101301232131 |
5 | 1020112142034323 |
6 | 23100432445433 |
7 | 2246215151262 |
oct | 366021615635 |
9 | 104211118433 |
10 | 33022221213 |
11 | 13006201613 |
12 | 64970a9879 |
13 | 3163559a87 |
14 | 1853997269 |
15 | cd410bc93 |
hex | 7b0471b9d |
33022221213 has 8 divisors (see below), whose sum is σ = 44080651008. Its totient is φ = 21989302784.
The previous prime is 33022221187. The next prime is 33022221223. The reversal of 33022221213 is 31212222033.
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 33022221213 - 212 = 33022217117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33022221213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33022221223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6374820 + ... + 6379997.
It is an arithmetic number, because the mean of its divisors is an integer number (5510081376).
Almost surely, 233022221213 is an apocalyptic number.
It is an amenable number.
33022221213 is a deficient number, since it is larger than the sum of its proper divisors (11058429795).
33022221213 is a wasteful number, since it uses less digits than its factorization.
33022221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12755683.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 33022221213 its reverse (31212222033), we get a palindrome (64234443246).
The spelling of 33022221213 in words is "thirty-three billion, twenty-two million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •