Base | Representation |
---|---|
bin | 1001000110011001011001… |
… | …00111100110100001111001 |
3 | 2121212000220002011221002001 |
4 | 10203030230213212201321 |
5 | 10110330012302223001 |
6 | 110320532124141001 |
7 | 4133514156540223 |
oct | 443145447464171 |
9 | 77760802157061 |
10 | 20011001211001 |
11 | 6415688552759 |
12 | 22b2323997761 |
13 | b2204c543648 |
14 | 4d2775365413 |
15 | 24a7eaab4001 |
hex | 12332c9e6879 |
20011001211001 has 4 divisors (see below), whose sum is σ = 20013158275492. Its totient is φ = 20008844146512.
The previous prime is 20011001210983. The next prime is 20011001211017. The reversal of 20011001211001 is 10011210011002.
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 6363510760000 + 13647490451001 = 2522600^2 + 3694251^2 .
It is a cyclic number.
It is not a de Polignac number, because 20011001211001 - 211 = 20011001208953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20011001211101) 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, 1078518330 + ... + 1078536883.
It is an arithmetic number, because the mean of its divisors is an integer number (5003289568873).
Almost surely, 220011001211001 is an apocalyptic number.
It is an amenable number.
20011001211001 is a deficient number, since it is larger than the sum of its proper divisors (2157064491).
20011001211001 is an equidigital number, since it uses as much as digits as its factorization.
20011001211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2157064490.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20011001211001 its reverse (10011210011002), we get a palindrome (30022211222003).
The spelling of 20011001211001 in words is "twenty trillion, eleven billion, one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •