Base | Representation |
---|---|
bin | 10010101011011000… |
… | …100011100100111111 |
3 | 1220202200102020112210 |
4 | 102223120203210333 |
5 | 312033113212203 |
6 | 13114020431503 |
7 | 1306662321612 |
oct | 225330434477 |
9 | 56680366483 |
10 | 20055210303 |
11 | 8561709377 |
12 | 3a78548593 |
13 | 1b77c6875b |
14 | d83778179 |
15 | 7c5a24803 |
hex | 4ab62393f |
20055210303 has 8 divisors (see below), whose sum is σ = 26740935216. Its totient is φ = 13369812800.
The previous prime is 20055210271. The next prime is 20055210313. The reversal of 20055210303 is 30301255002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20055210303 - 25 = 20055210271 is a prime.
It is a super-2 number, since 2×200552103032 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20055210303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20055210313) 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, 191293 + ... + 276953.
It is an arithmetic number, because the mean of its divisors is an integer number (3342616902).
Almost surely, 220055210303 is an apocalyptic number.
20055210303 is a deficient number, since it is larger than the sum of its proper divisors (6685724913).
20055210303 is an equidigital number, since it uses as much as digits as its factorization.
20055210303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163705.
The product of its (nonzero) digits is 900, while the sum is 21.
Adding to 20055210303 its reverse (30301255002), we get a palindrome (50356465305).
The spelling of 20055210303 in words is "twenty billion, fifty-five million, two hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •