Base | Representation |
---|---|
bin | 1001000110101010100011… |
… | …00001001011110001000101 |
3 | 2121212220122212120001200011 |
4 | 10203111101201023301011 |
5 | 10111002342304020401 |
6 | 110325054013150221 |
7 | 4134261321040240 |
oct | 443252141136105 |
9 | 77786585501604 |
10 | 20020210220101 |
11 | 641958381a583 |
12 | 22b4073a8b371 |
13 | b22b893b3760 |
14 | 4d2daa426257 |
15 | 24ab892c9451 |
hex | 12355184bc45 |
20020210220101 has 16 divisors (see below), whose sum is σ = 24641033355904. Its totient is φ = 15839668355904.
The previous prime is 20020210220063. The next prime is 20020210220111. The reversal of 20020210220101 is 10102201202002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20020210220101 - 29 = 20020210219589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020210220111) 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 15 ways as a sum of consecutive naturals, for example, 534075 + ... + 6350248.
It is an arithmetic number, because the mean of its divisors is an integer number (1540064584744).
Almost surely, 220020210220101 is an apocalyptic number.
It is an amenable number.
20020210220101 is a deficient number, since it is larger than the sum of its proper divisors (4620823135803).
20020210220101 is a wasteful number, since it uses less digits than its factorization.
20020210220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6916300.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20020210220101 its reverse (10102201202002), we get a palindrome (30122411422103).
The spelling of 20020210220101 in words is "twenty trillion, twenty billion, two hundred ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •