Base | Representation |
---|---|
bin | 10010111101001000… |
… | …100011001111110101 |
3 | 1221112102202202102201 |
4 | 102331020203033311 |
5 | 313140332121113 |
6 | 13203335304501 |
7 | 1320236453431 |
oct | 227510431765 |
9 | 57472682381 |
10 | 20353004533 |
11 | 86a4816604 |
12 | 3b4021b131 |
13 | 1bc4873564 |
14 | db11359c1 |
15 | 7e1c49cdd |
hex | 4bd2233f5 |
20353004533 has 4 divisors (see below), whose sum is σ = 20562829420. Its totient is φ = 20143179648.
The previous prime is 20353004531. The next prime is 20353004569. The reversal of 20353004533 is 33540035302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4907983249 + 15445021284 = 70057^2 + 124278^2 .
It is a cyclic number.
It is not a de Polignac number, because 20353004533 - 21 = 20353004531 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 (20353004531) 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, 104912298 + ... + 104912491.
It is an arithmetic number, because the mean of its divisors is an integer number (5140707355).
Almost surely, 220353004533 is an apocalyptic number.
It is an amenable number.
20353004533 is a deficient number, since it is larger than the sum of its proper divisors (209824887).
20353004533 is an equidigital number, since it uses as much as digits as its factorization.
20353004533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209824886.
The product of its (nonzero) digits is 16200, while the sum is 28.
Adding to 20353004533 its reverse (33540035302), we get a palindrome (53893039835).
The spelling of 20353004533 in words is "twenty billion, three hundred fifty-three million, four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •