Base | Representation |
---|---|
bin | 10010111010000110… |
… | …000011111011001111 |
3 | 1221101212211111012220 |
4 | 102322012003323033 |
5 | 313034304122203 |
6 | 13154314430423 |
7 | 1316050216365 |
oct | 227206037317 |
9 | 57355744186 |
10 | 20302020303 |
11 | 8678a63384 |
12 | 3b27132413 |
13 | 1bb7132186 |
14 | da8463635 |
15 | 7dc528653 |
hex | 4ba183ecf |
20302020303 has 8 divisors (see below), whose sum is σ = 27317703600. Its totient is φ = 13410508608.
The previous prime is 20302020289. The next prime is 20302020317. The reversal of 20302020303 is 30302020302.
It is an interprime number because it is at equal distance from previous prime (20302020289) and next prime (20302020317).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20302020303 - 28 = 20302020047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20302020383) 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, 31042518 + ... + 31043171.
It is an arithmetic number, because the mean of its divisors is an integer number (3414712950).
Almost surely, 220302020303 is an apocalyptic number.
20302020303 is a deficient number, since it is larger than the sum of its proper divisors (7015683297).
20302020303 is a wasteful number, since it uses less digits than its factorization.
20302020303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62085801.
The product of its (nonzero) digits is 216, while the sum is 15.
Adding to 20302020303 its reverse (30302020302), we get a palindrome (50604040605).
Subtracting 20302020303 from its reverse (30302020302), we obtain a palindrome (9999999999).
The spelling of 20302020303 in words is "twenty billion, three hundred two million, twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •