Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …10101000110010100110101 |
3 | 2121211000000100012211121120 |
4 | 10203002220311012110311 |
5 | 10110140402224101010 |
6 | 110311544245334153 |
7 | 4132652414622333 |
oct | 443025065062465 |
9 | 77730010184546 |
10 | 20000200222005 |
11 | 6411045691873 |
12 | 22b020a707359 |
13 | b2101a9180b3 |
14 | 4d202ca9ab53 |
15 | 24a3b7735e70 |
hex | 1230a8d46535 |
20000200222005 has 48 divisors (see below), whose sum is σ = 32492743004160. Its totient is φ = 10504997186944.
The previous prime is 20000200222003. The next prime is 20000200222043. The reversal of 20000200222005 is 50022200200002.
It is not a de Polignac number, because 20000200222005 - 21 = 20000200222003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000200222003) 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 47 ways as a sum of consecutive naturals, for example, 32451916 + ... + 33062474.
It is an arithmetic number, because the mean of its divisors is an integer number (676932145920).
Almost surely, 220000200222005 is an apocalyptic number.
It is an amenable number.
20000200222005 is a deficient number, since it is larger than the sum of its proper divisors (12492542782155).
20000200222005 is an equidigital number, since it uses as much as digits as its factorization.
20000200222005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611050 (or 610967 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 15.
Adding to 20000200222005 its reverse (50022200200002), we get a palindrome (70022400422007).
The spelling of 20000200222005 in words is "twenty trillion, two hundred million, two hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •