Base | Representation |
---|---|
bin | 11110110001111101… |
… | …101010110011011101 |
3 | 10011022100100120202001 |
4 | 132301331222303131 |
5 | 1020141412120123 |
6 | 23103323002301 |
7 | 2250010436503 |
oct | 366175526335 |
9 | 104270316661 |
10 | 33050504413 |
11 | 1302016a163 |
12 | 64a4669391 |
13 | 31693804b4 |
14 | 185763a673 |
15 | cd68470ad |
hex | 7b1f6acdd |
33050504413 has 4 divisors (see below), whose sum is σ = 33060341308. Its totient is φ = 33040667520.
The previous prime is 33050504401. The next prime is 33050504447. The reversal of 33050504413 is 31440505033.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31440505033 = 7 ⋅4491500719.
It can be written as a sum of positive squares in 2 ways, for example, as 16660871929 + 16389632484 = 129077^2 + 128022^2 .
It is a cyclic number.
It is not a de Polignac number, because 33050504413 - 229 = 32513633501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33050504213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4913406 + ... + 4920127.
It is an arithmetic number, because the mean of its divisors is an integer number (8265085327).
Almost surely, 233050504413 is an apocalyptic number.
It is an amenable number.
33050504413 is a deficient number, since it is larger than the sum of its proper divisors (9836895).
33050504413 is an equidigital number, since it uses as much as digits as its factorization.
33050504413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9836894.
The product of its (nonzero) digits is 10800, while the sum is 28.
The spelling of 33050504413 in words is "thirty-three billion, fifty million, five hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •