Base | Representation |
---|---|
bin | 10010101110010110… |
… | …101100101111100001 |
3 | 1220220011012121220010 |
4 | 102232112230233201 |
5 | 312133343231301 |
6 | 13123001035133 |
7 | 1311136102200 |
oct | 225626545741 |
9 | 56804177803 |
10 | 20105055201 |
11 | 8587863600 |
12 | 3a91185aa9 |
13 | 1b8539b38a |
14 | d8a231237 |
15 | 7ca0bd5d6 |
hex | 4ae5acbe1 |
20105055201 has 72 divisors (see below), whose sum is σ = 34341566112. Its totient is φ = 10424198400.
The previous prime is 20105055199. The next prime is 20105055203. The reversal of 20105055201 is 10255050102.
It is an interprime number because it is at equal distance from previous prime (20105055199) and next prime (20105055203).
It is not a de Polignac number, because 20105055201 - 21 = 20105055199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (20105055203) 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 71 ways as a sum of consecutive naturals, for example, 15669706 + ... + 15670988.
It is an arithmetic number, because the mean of its divisors is an integer number (476966196).
Almost surely, 220105055201 is an apocalyptic number.
20105055201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20105055201 is a deficient number, since it is larger than the sum of its proper divisors (14236510911).
20105055201 is a wasteful number, since it uses less digits than its factorization.
20105055201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2203 (or 2185 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 21.
The spelling of 20105055201 in words is "twenty billion, one hundred five million, fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •