Base | Representation |
---|---|
bin | 1001001001010011110110… |
… | …00010011100111000000001 |
3 | 2122012121021012211011201002 |
4 | 10210221323002130320001 |
5 | 10114000013341320001 |
6 | 110434525020421345 |
7 | 4143656555661503 |
oct | 444517302347001 |
9 | 78177235734632 |
10 | 20111101120001 |
11 | 6454085317981 |
12 | 23097bb0a7855 |
13 | b2b612964328 |
14 | 4d754d791d73 |
15 | 24d20898646b |
hex | 124a7b09ce01 |
20111101120001 has 2 divisors, whose sum is σ = 20111101120002. Its totient is φ = 20111101120000.
The previous prime is 20111101119997. The next prime is 20111101120027. The reversal of 20111101120001 is 10002110111102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16670072410000 + 3441028710001 = 4082900^2 + 1855001^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111101120001 - 22 = 20111101119997 is a prime.
It is not a weakly prime, because it can be changed into another prime (20111101120081) 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, 10055550560000 + 10055550560001.
It is an arithmetic number, because the mean of its divisors is an integer number (10055550560001).
Almost surely, 220111101120001 is an apocalyptic number.
It is an amenable number.
20111101120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111101120001 is an equidigital number, since it uses as much as digits as its factorization.
20111101120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 20111101120001 its reverse (10002110111102), we get a palindrome (30113211231103).
The spelling of 20111101120001 in words is "twenty trillion, one hundred eleven billion, one hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •