Base | Representation |
---|---|
bin | 1001001001010010000000… |
… | …00001110100110001100001 |
3 | 2122012111201012220221120200 |
4 | 10210221000001310301201 |
5 | 10113441001420200001 |
6 | 110434242453055413 |
7 | 4143623204645016 |
oct | 444510001646141 |
9 | 78174635827520 |
10 | 20110111100001 |
11 | 64537174a022a |
12 | 2309583627569 |
13 | b2b4b580c890 |
14 | 4d74980c170d |
15 | 24d19bac7086 |
hex | 124a40074c61 |
20110111100001 has 24 divisors (see below), whose sum is σ = 31301837472360. Its totient is φ = 12367761474816.
The previous prime is 20110111099951. The next prime is 20110111100077. The reversal of 20110111100001 is 10000111101102.
It can be written as a sum of positive squares in 4 ways, for example, as 8468885718225 + 11641225381776 = 2910135^2 + 3411924^2 .
It is not a de Polignac number, because 20110111100001 - 29 = 20110111099489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20110111100701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53224206 + ... + 53600711.
It is an arithmetic number, because the mean of its divisors is an integer number (1304243228015).
Almost surely, 220110111100001 is an apocalyptic number.
It is an amenable number.
20110111100001 is a deficient number, since it is larger than the sum of its proper divisors (11191726372359).
20110111100001 is a wasteful number, since it uses less digits than its factorization.
20110111100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106826545 (or 106826542 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 20110111100001 its reverse (10000111101102), we get a palindrome (30110222201103).
The spelling of 20110111100001 in words is "twenty trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •