Base | Representation |
---|---|
bin | 1000000011001… |
… | …1011001111110 |
3 | 2100112102212012 |
4 | 2000303121332 |
5 | 32120434430 |
6 | 3203411222 |
7 | 556666130 |
oct | 200633176 |
9 | 70472765 |
10 | 33764990 |
11 | 18072156 |
12 | b383b12 |
13 | 6cc28ac |
14 | 46ad050 |
15 | 2e6e695 |
hex | 203367e |
33764990 has 32 divisors (see below), whose sum is σ = 71858880. Its totient is φ = 11176704.
The previous prime is 33764987. The next prime is 33764993. The reversal of 33764990 is 9946733.
33764990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (33764987) and next prime (33764993).
It is a super-2 number, since 2×337649902 = 2280149099400200, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33764993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6287 + ... + 10346.
It is an arithmetic number, because the mean of its divisors is an integer number (2245590).
Almost surely, 233764990 is an apocalyptic number.
33764990 is an abundant number, since it is smaller than the sum of its proper divisors (38093890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33764990 is a wasteful number, since it uses less digits than its factorization.
33764990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16676.
The product of its (nonzero) digits is 122472, while the sum is 41.
The square root of 33764990 is about 5810.7650098761. The cubic root of 33764990 is about 323.2130408321.
The spelling of 33764990 in words is "thirty-three million, seven hundred sixty-four thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •