Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …10101100110101101100001 |
3 | 2122112002201202011100221100 |
4 | 10211330231311212231201 |
5 | 10121424100024020001 |
6 | 110543430232545013 |
7 | 4153254556603200 |
oct | 445745565465541 |
9 | 78462652140840 |
10 | 20200000220001 |
11 | 6488854569558 |
12 | 2322a8b252169 |
13 | b36b0c67c094 |
14 | 4db984399237 |
15 | 2506ad350586 |
hex | 125f2dd66b61 |
20200000220001 has 18 divisors (see below), whose sum is σ = 33941496969042. Its totient is φ = 11542857268320.
The previous prime is 20200000219991. The next prime is 20200000220017. The reversal of 20200000220001 is 10002200000202.
It can be written as a sum of positive squares in only one way, i.e., 19138175078400 + 1061825141601 = 4374720^2 + 1030449^2 .
It is not a de Polignac number, because 20200000220001 - 218 = 20199999957857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20200000220801) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 22902494140 + ... + 22902495021.
Almost surely, 220200000220001 is an apocalyptic number.
20200000220001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20200000220001 is a deficient number, since it is larger than the sum of its proper divisors (13741496749041).
20200000220001 is a wasteful number, since it uses less digits than its factorization.
20200000220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45804989181 (or 45804989171 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 20200000220001 its reverse (10002200000202), we get a palindrome (30202200220203).
The spelling of 20200000220001 in words is "twenty trillion, two hundred billion, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •