Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00101010110100011001101 |
3 | 2122011122202120221100212111 |
4 | 10210200232011112203031 |
5 | 10113314244321202201 |
6 | 110430212324104021 |
7 | 4143156654463054 |
oct | 444405605264315 |
9 | 78148676840774 |
10 | 20101220100301 |
11 | 644a97478859a |
12 | 2307901b35011 |
13 | b2a6c9804902 |
14 | 4d6c9336139b |
15 | 24cd2b27bb51 |
hex | 12482e1568cd |
20101220100301 has 2 divisors, whose sum is σ = 20101220100302. Its totient is φ = 20101220100300.
The previous prime is 20101220100251. The next prime is 20101220100307. The reversal of 20101220100301 is 10300102210102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15137351955625 + 4963868144676 = 3890675^2 + 2227974^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101220100301 - 29 = 20101220099789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101220100307) 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 as a sum of consecutive naturals, namely, 10050610050150 + 10050610050151.
It is an arithmetic number, because the mean of its divisors is an integer number (10050610050151).
Almost surely, 220101220100301 is an apocalyptic number.
It is an amenable number.
20101220100301 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101220100301 is an equidigital number, since it uses as much as digits as its factorization.
20101220100301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20101220100301 its reverse (10300102210102), we get a palindrome (30401322310403).
The spelling of 20101220100301 in words is "twenty trillion, one hundred one billion, two hundred twenty million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •