Base | Representation |
---|---|
bin | 10010110100010100… |
… | …101110111000111101 |
3 | 1221011010122122212001 |
4 | 102310110232320331 |
5 | 312340012444010 |
6 | 13140535342301 |
7 | 1313463251251 |
oct | 226424567075 |
9 | 57133578761 |
10 | 20205203005 |
11 | 8629346089 |
12 | 3aba821991 |
13 | 1ba0064230 |
14 | d99660261 |
15 | 7d3ca1c3a |
hex | 4b452ee3d |
20205203005 has 16 divisors (see below), whose sum is σ = 26117776944. Its totient is φ = 14917086720.
The previous prime is 20205202999. The next prime is 20205203099. The reversal of 20205203005 is 50030250202.
It can be written as a sum of positive squares in 8 ways, for example, as 15350724 + 20189852281 = 3918^2 + 142091^2 .
It is not a de Polignac number, because 20205203005 - 217 = 20205071933 is a prime.
It is a super-2 number, since 2×202052030052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 243135 + ... + 315475.
It is an arithmetic number, because the mean of its divisors is an integer number (1632361059).
Almost surely, 220205203005 is an apocalyptic number.
It is an amenable number.
20205203005 is a deficient number, since it is larger than the sum of its proper divisors (5912573939).
20205203005 is a wasteful number, since it uses less digits than its factorization.
20205203005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76656.
The product of its (nonzero) digits is 600, while the sum is 19.
Adding to 20205203005 its reverse (50030250202), we get a palindrome (70235453207).
It can be divided in two parts, 2020 and 5203005, that added together give a palindrome (5205025).
The spelling of 20205203005 in words is "twenty billion, two hundred five million, two hundred three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •