Base | Representation |
---|---|
bin | 11110110000010001… |
… | …110100011101011101 |
3 | 10011020101011012211221 |
4 | 132300101310131131 |
5 | 1020112142414123 |
6 | 23100433013341 |
7 | 2246215226032 |
oct | 366021643535 |
9 | 104211135757 |
10 | 33022232413 |
11 | 13006209a75 |
12 | 64970b4251 |
13 | 3163561bc1 |
14 | 185399b389 |
15 | cd411025d |
hex | 7b047475d |
33022232413 has 8 divisors (see below), whose sum is σ = 33239691576. Its totient is φ = 32805158400.
The previous prime is 33022232407. The next prime is 33022232443. The reversal of 33022232413 is 31423222033.
It can be written as a sum of positive squares in 4 ways, for example, as 873025209 + 32149207204 = 29547^2 + 179302^2 .
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 33022232413 - 29 = 33022231901 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 (33022232443) 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, 76773 + ... + 268213.
It is an arithmetic number, because the mean of its divisors is an integer number (4154961447).
Almost surely, 233022232413 is an apocalyptic number.
It is an amenable number.
33022232413 is a deficient number, since it is larger than the sum of its proper divisors (217459163).
33022232413 is a wasteful number, since it uses less digits than its factorization.
33022232413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192575.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 33022232413 its reverse (31423222033), we get a palindrome (64445454446).
The spelling of 33022232413 in words is "thirty-three billion, twenty-two million, two hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •