Base | Representation |
---|---|
bin | 11110110000011101… |
… | …001010001100011101 |
3 | 10011020120202020111112 |
4 | 132300131022030131 |
5 | 1020113423030041 |
6 | 23101020431405 |
7 | 2246252416364 |
oct | 366035121435 |
9 | 104216666445 |
10 | 33025205021 |
11 | 1300795a376 |
12 | 64980a8565 |
13 | 3164062c43 |
14 | 18541327db |
15 | cd44eadeb |
hex | 7b074a31d |
33025205021 has 8 divisors (see below), whose sum is σ = 33058170360. Its totient is φ = 32992260352.
The previous prime is 33025205011. The next prime is 33025205029. The reversal of 33025205021 is 12050252033.
It can be written as a sum of positive squares in 4 ways, for example, as 3686311225 + 29338893796 = 60715^2 + 171286^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 33025205021 - 234 = 15845335837 is a prime.
It is a super-2 number, since 2×330252050212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33025205029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6260441 + ... + 6265713.
It is an arithmetic number, because the mean of its divisors is an integer number (4132271295).
Almost surely, 233025205021 is an apocalyptic number.
It is an amenable number.
33025205021 is a deficient number, since it is larger than the sum of its proper divisors (32965339).
33025205021 is a wasteful number, since it uses less digits than its factorization.
33025205021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10335.
The product of its (nonzero) digits is 1800, while the sum is 23.
Adding to 33025205021 its reverse (12050252033), we get a palindrome (45075457054).
The spelling of 33025205021 in words is "thirty-three billion, twenty-five million, two hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •