Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01010110011000000101001 |
3 | 2122011122020122210102120201 |
4 | 10210200202022303000221 |
5 | 10113313342132413001 |
6 | 110430140423352201 |
7 | 4143152006405215 |
oct | 444404212630051 |
9 | 78148218712521 |
10 | 20101020201001 |
11 | 644a881964263 |
12 | 2307866bb2661 |
13 | b2a6972843bc |
14 | 4d6c749a7945 |
15 | 24cd18942501 |
hex | 1248222b3029 |
20101020201001 has 4 divisors (see below), whose sum is σ = 20101757799172. Its totient is φ = 20100282602832.
The previous prime is 20101020200999. The next prime is 20101020201037. The reversal of 20101020201001 is 10010202010102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9981934736400 + 10119085464601 = 3159420^2 + 3181051^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101020201001 - 21 = 20101020200999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101020201401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368758206 + ... + 368812711.
It is an arithmetic number, because the mean of its divisors is an integer number (5025439449793).
Almost surely, 220101020201001 is an apocalyptic number.
It is an amenable number.
20101020201001 is a deficient number, since it is larger than the sum of its proper divisors (737598171).
20101020201001 is an equidigital number, since it uses as much as digits as its factorization.
20101020201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737598170.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20101020201001 its reverse (10010202010102), we get a palindrome (30111222211103).
The spelling of 20101020201001 in words is "twenty trillion, one hundred one billion, twenty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •