Base | Representation |
---|---|
bin | 10011000111011010… |
… | …011001011101100101 |
3 | 1221222110021011021122 |
4 | 103013122121131211 |
5 | 314014004031310 |
6 | 13232415423325 |
7 | 1324432330163 |
oct | 230732313545 |
9 | 57873234248 |
10 | 20525455205 |
11 | 87830a2322 |
12 | 3b89b24b45 |
13 | 1c21503188 |
14 | dc9dc6233 |
15 | 801e61555 |
hex | 4c7699765 |
20525455205 has 8 divisors (see below), whose sum is σ = 24766627704. Its totient is φ = 16329643200.
The previous prime is 20525455201. The next prime is 20525455241. The reversal of 20525455205 is 50255452502.
It can be written as a sum of positive squares in 4 ways, for example, as 414244609 + 20111210596 = 20353^2 + 141814^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20525455205 - 22 = 20525455201 is a prime.
It is a super-2 number, since 2×205254552052 (a number of 21 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 (20525455201) 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, 11339126 + ... + 11340935.
It is an arithmetic number, because the mean of its divisors is an integer number (3095828463).
Almost surely, 220525455205 is an apocalyptic number.
It is an amenable number.
20525455205 is a deficient number, since it is larger than the sum of its proper divisors (4241172499).
20525455205 is a wasteful number, since it uses less digits than its factorization.
20525455205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22680247.
The product of its (nonzero) digits is 100000, while the sum is 35.
The spelling of 20525455205 in words is "twenty billion, five hundred twenty-five million, four hundred fifty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •