Base | Representation |
---|---|
bin | 11110110110111000… |
… | …110000110001010101 |
3 | 10011112002210002100220 |
4 | 132312320300301111 |
5 | 1020324033313323 |
6 | 23115433224553 |
7 | 2252032511316 |
oct | 366670606125 |
9 | 104462702326 |
10 | 33133104213 |
11 | 13062856660 |
12 | 6508262159 |
13 | 3180511011 |
14 | 18645bc60d |
15 | cddc110e3 |
hex | 7b6e30c55 |
33133104213 has 32 divisors (see below), whose sum is σ = 49410127872. Its totient is φ = 19574601600.
The previous prime is 33133104209. The next prime is 33133104253. The reversal of 33133104213 is 31240133133.
It is a happy number.
It is not a de Polignac number, because 33133104213 - 22 = 33133104209 is a prime.
It is a super-3 number, since 3×331331042133 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33133104253) 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 31 ways as a sum of consecutive naturals, for example, 1726356 + ... + 1745442.
It is an arithmetic number, because the mean of its divisors is an integer number (1544066496).
Almost surely, 233133104213 is an apocalyptic number.
33133104213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
33133104213 is a deficient number, since it is larger than the sum of its proper divisors (16277023659).
33133104213 is a wasteful number, since it uses less digits than its factorization.
33133104213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20425.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 33133104213 its reverse (31240133133), we get a palindrome (64373237346).
The spelling of 33133104213 in words is "thirty-three billion, one hundred thirty-three million, one hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •