Base | Representation |
---|---|
bin | 11110110001100010… |
… | …010001110001110101 |
3 | 10011021211211210002121 |
4 | 132301202101301311 |
5 | 1020133042332041 |
6 | 23102505035541 |
7 | 2246562422431 |
oct | 366142216165 |
9 | 104254753077 |
10 | 33043324021 |
11 | 13017105454 |
12 | 64a2185bb1 |
13 | 3167a38146 |
14 | 18566cb9c1 |
15 | cd5dc97d1 |
hex | 7b1891c75 |
33043324021 has 2 divisors, whose sum is σ = 33043324022. Its totient is φ = 33043324020.
The previous prime is 33043324019. The next prime is 33043324033. The reversal of 33043324021 is 12042334033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31386019921 + 1657304100 = 177161^2 + 40710^2 .
It is an emirp because it is prime and its reverse (12042334033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 33043324021 - 21 = 33043324019 is a prime.
It is a super-2 number, since 2×330433240212 (a number of 22 digits) contains 22 as substring.
Together with 33043324019, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33043324051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16521662010 + 16521662011.
It is an arithmetic number, because the mean of its divisors is an integer number (16521662011).
Almost surely, 233043324021 is an apocalyptic number.
It is an amenable number.
33043324021 is a deficient number, since it is larger than the sum of its proper divisors (1).
33043324021 is an equidigital number, since it uses as much as digits as its factorization.
33043324021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 33043324021 its reverse (12042334033), we get a palindrome (45085658054).
The spelling of 33043324021 in words is "thirty-three billion, forty-three million, three hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •