Base | Representation |
---|---|
bin | 1111000110111010111010… |
… | …00000011001011110110101 |
3 | 11100122002201012222102010201 |
4 | 13203131131000121132311 |
5 | 13323311433344420041 |
6 | 154354255112520501 |
7 | 6666202123050145 |
oct | 743353500313665 |
9 | 140562635872121 |
10 | 33223132420021 |
11 | a649940142525 |
12 | 3886a479b0131 |
13 | 156cc0a9025cb |
14 | 82c018682925 |
15 | 3c932370c631 |
hex | 1e375d0197b5 |
33223132420021 has 2 divisors, whose sum is σ = 33223132420022. Its totient is φ = 33223132420020.
The previous prime is 33223132420001. The next prime is 33223132420061. The reversal of 33223132420021 is 12002423132233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29031944896900 + 4191187523121 = 5388130^2 + 2047239^2 .
It is a cyclic number.
It is not a de Polignac number, because 33223132420021 - 29 = 33223132419509 is a prime.
It is a super-2 number, since 2×332231324200212 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33223132420001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16611566210010 + 16611566210011.
It is an arithmetic number, because the mean of its divisors is an integer number (16611566210011).
Almost surely, 233223132420021 is an apocalyptic number.
It is an amenable number.
33223132420021 is a deficient number, since it is larger than the sum of its proper divisors (1).
33223132420021 is an equidigital number, since it uses as much as digits as its factorization.
33223132420021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 33223132420021 its reverse (12002423132233), we get a palindrome (45225555552254).
The spelling of 33223132420021 in words is "thirty-three trillion, two hundred twenty-three billion, one hundred thirty-two million, four hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •