Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …00010011111000111000101 |
3 | 2121211012011201120021020010 |
4 | 10203010200002133013011 |
5 | 10110204001224020401 |
6 | 110312514532300433 |
7 | 4133053111415511 |
oct | 443044002370705 |
9 | 77735151507203 |
10 | 20002200220101 |
11 | 6411981627a60 |
12 | 22b0688471719 |
13 | b21279091618 |
14 | 4d217c555141 |
15 | 24a4830e7ed6 |
hex | 12312009f1c5 |
20002200220101 has 16 divisors (see below), whose sum is σ = 29571062027328. Its totient is φ = 11923815331200.
The previous prime is 20002200220081. The next prime is 20002200220103. The reversal of 20002200220101 is 10102200220002.
It is not a de Polignac number, because 20002200220101 - 243 = 11206107197893 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002200220103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4968254376 + ... + 4968258401.
It is an arithmetic number, because the mean of its divisors is an integer number (1848191376708).
Almost surely, 220002200220101 is an apocalyptic number.
It is an amenable number.
20002200220101 is a deficient number, since it is larger than the sum of its proper divisors (9568861807227).
20002200220101 is a wasteful number, since it uses less digits than its factorization.
20002200220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9936512852.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20002200220101 its reverse (10102200220002), we get a palindrome (30104400440103).
Subtracting from 20002200220101 its reverse (10102200220002), we obtain a palindrome (9900000000099).
The spelling of 20002200220101 in words is "twenty trillion, two billion, two hundred million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •