Base | Representation |
---|---|
bin | 11110111011001000… |
… | …011100100000111101 |
3 | 10011201001210110010002 |
4 | 132323020130200331 |
5 | 1021000301340123 |
6 | 23130455524045 |
7 | 2253556046351 |
oct | 367310344075 |
9 | 104631713102 |
10 | 33204324413 |
11 | 13099a80427 |
12 | 6528089625 |
13 | 31921b9050 |
14 | 186dc3b461 |
15 | ce50cd528 |
hex | 7bb21c83d |
33204324413 has 8 divisors (see below), whose sum is σ = 36590096928. Its totient is φ = 29937351024.
The previous prime is 33204324317. The next prime is 33204324421. The reversal of 33204324413 is 31442340233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33204324413 is a prime.
It is a super-2 number, since 2×332043244132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33204324443) 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 7 ways as a sum of consecutive naturals, for example, 29699195 + ... + 29700312.
It is an arithmetic number, because the mean of its divisors is an integer number (4573762116).
Almost surely, 233204324413 is an apocalyptic number.
It is an amenable number.
33204324413 is a deficient number, since it is larger than the sum of its proper divisors (3385772515).
33204324413 is a wasteful number, since it uses less digits than its factorization.
33204324413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59399563.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 33204324413 its reverse (31442340233), we get a palindrome (64646664646).
The spelling of 33204324413 in words is "thirty-three billion, two hundred four million, three hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •