Base | Representation |
---|---|
bin | 10010101000011011… |
… | …000111100011111101 |
3 | 1220122012222020212122 |
4 | 102220123013203331 |
5 | 311432410102313 |
6 | 13105044212325 |
7 | 1305520241426 |
oct | 225033074375 |
9 | 56565866778 |
10 | 20005550333 |
11 | 853668007a |
12 | 3a6399a0a5 |
13 | 1b6a89c062 |
14 | d7ad2c64d |
15 | 7c14b5708 |
hex | 4a86c78fd |
20005550333 has 4 divisors (see below), whose sum is σ = 20036663808. Its totient is φ = 19974436860.
The previous prime is 20005550303. The next prime is 20005550347. The reversal of 20005550333 is 33305550002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33305550002 = 2 ⋅16652775001.
It is a cyclic number.
It is not a de Polignac number, because 20005550333 - 224 = 19988773117 is a prime.
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 (20005550303) 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 3 ways as a sum of consecutive naturals, for example, 15555773 + ... + 15557058.
It is an arithmetic number, because the mean of its divisors is an integer number (5009165952).
Almost surely, 220005550333 is an apocalyptic number.
It is an amenable number.
20005550333 is a deficient number, since it is larger than the sum of its proper divisors (31113475).
20005550333 is an equidigital number, since it uses as much as digits as its factorization.
20005550333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31113474.
The product of its (nonzero) digits is 6750, while the sum is 26.
The spelling of 20005550333 in words is "twenty billion, five million, five hundred fifty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •