Base | Representation |
---|---|
bin | 11110110000001010… |
… | …001001101101111011 |
3 | 10011020020101002112110 |
4 | 132300022021231323 |
5 | 1020111134103311 |
6 | 23100321543403 |
7 | 2246162154525 |
oct | 366012115573 |
9 | 104206332473 |
10 | 33020222331 |
11 | 13005066848 |
12 | 64964a4b63 |
13 | 3163009cc5 |
14 | 18535d6a15 |
15 | cd3d648a6 |
hex | 7b0289b7b |
33020222331 has 4 divisors (see below), whose sum is σ = 44026963112. Its totient is φ = 22013481552.
The previous prime is 33020222329. The next prime is 33020222401. The reversal of 33020222331 is 13322202033.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 33020222331 - 21 = 33020222329 is a prime.
It is a super-2 number, since 2×330202223312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33020222298 and 33020222307.
It is not an unprimeable number, because it can be changed into a prime (33020223331) 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 3 ways as a sum of consecutive naturals, for example, 5503370386 + ... + 5503370391.
It is an arithmetic number, because the mean of its divisors is an integer number (11006740778).
Almost surely, 233020222331 is an apocalyptic number.
33020222331 is a deficient number, since it is larger than the sum of its proper divisors (11006740781).
33020222331 is a wasteful number, since it uses less digits than its factorization.
33020222331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11006740780.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 33020222331 its reverse (13322202033), we get a palindrome (46342424364).
The spelling of 33020222331 in words is "thirty-three billion, twenty million, two hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •