Base | Representation |
---|---|
bin | 1001001001010010001010… |
… | …11001001100010111000001 |
3 | 2122012111221111022000211110 |
4 | 10210221011121030113001 |
5 | 10113441142441041001 |
6 | 110434255430233533 |
7 | 4143625350020460 |
oct | 444510531142701 |
9 | 78174844260743 |
10 | 20110201112001 |
11 | 645376328a610 |
12 | 23095a97b58a9 |
13 | b2b4cb367110 |
14 | 4d74a60329d7 |
15 | 24d1a49573d6 |
hex | 124a4564c5c1 |
20110201112001 has 384 divisors, whose sum is σ = 39188867751936. Its totient is φ = 8835690885120.
The previous prime is 20110201111997. The next prime is 20110201112017. The reversal of 20110201112001 is 10021110201102.
It is not a de Polignac number, because 20110201112001 - 22 = 20110201111997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20110201112021) by changing a digit.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 11471876541 + ... + 11471878293.
It is an arithmetic number, because the mean of its divisors is an integer number (102054343104).
Almost surely, 220110201112001 is an apocalyptic number.
20110201112001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20110201112001 is a deficient number, since it is larger than the sum of its proper divisors (19078666639935).
20110201112001 is a wasteful number, since it uses less digits than its factorization.
20110201112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1981 (or 1914 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20110201112001 its reverse (10021110201102), we get a palindrome (30131311313103).
It can be divided in two parts, 20110201 and 112001, that added together give a palindrome (20222202).
The spelling of 20110201112001 in words is "twenty trillion, one hundred ten billion, two hundred one million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •