Base | Representation |
---|---|
bin | 100111000111… |
… | …1000010101011 |
3 | 1102120221211210 |
4 | 1032033002223 |
5 | 20222240333 |
6 | 2011324203 |
7 | 336215355 |
oct | 116170253 |
9 | 42527753 |
10 | 20508843 |
11 | 10638663 |
12 | 6a50663 |
13 | 4330c14 |
14 | 2a1c0d5 |
15 | 1c01a63 |
hex | 138f0ab |
20508843 has 4 divisors (see below), whose sum is σ = 27345128. Its totient is φ = 13672560.
The previous prime is 20508833. The next prime is 20508853. The reversal of 20508843 is 34880502.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20508833) and next prime (20508853).
It is not a de Polignac number, because 20508843 - 25 = 20508811 is a prime.
It is a super-2 number, since 2×205088432 = 841225282397298, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20508843.
It is not an unprimeable number, because it can be changed into a prime (20508833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3418138 + ... + 3418143.
It is an arithmetic number, because the mean of its divisors is an integer number (6836282).
Almost surely, 220508843 is an apocalyptic number.
20508843 is a deficient number, since it is larger than the sum of its proper divisors (6836285).
20508843 is an equidigital number, since it uses as much as digits as its factorization.
20508843 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6836284.
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 20508843 is about 4528.6690097643. The cubic root of 20508843 is about 273.7245308971.
The spelling of 20508843 in words is "twenty million, five hundred eight thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •