Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1001010001101010100001 |
3 | 1102222112201211121101121112 |
4 | 2200031313021101222201 |
5 | 2420341440011200001 |
6 | 35225531344233105 |
7 | 2214306031502660 |
oct | 240156711215241 |
9 | 42875654541545 |
10 | 11010000100001 |
11 | 3565351032071 |
12 | 129998a90b795 |
13 | 61b314147ba6 |
14 | 2a0c5b722dd7 |
15 | 1415de586cbb |
hex | a0377251aa1 |
11010000100001 has 8 divisors (see below), whose sum is σ = 12614552114880. Its totient is φ = 9413371799568.
The previous prime is 11010000099991. The next prime is 11010000100003. The reversal of 11010000100001 is 10000100001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010000100001 - 214 = 11010000083617 is a prime.
It is a Duffinian number.
11010000100001 is a modest number, since divided by 100001 gives 1101 as remainder.
It is not an unprimeable number, because it can be changed into a prime (11010000100003) 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 in 7 ways as a sum of consecutive naturals, for example, 1980925631 + ... + 1980931188.
It is an arithmetic number, because the mean of its divisors is an integer number (1576819014360).
Almost surely, 211010000100001 is an apocalyptic number.
It is an amenable number.
11010000100001 is a deficient number, since it is larger than the sum of its proper divisors (1604552014879).
11010000100001 is an equidigital number, since it uses as much as digits as its factorization.
11010000100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3961857223.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11010000100001 its reverse (10000100001011), we get a palindrome (21010100101012).
The spelling of 11010000100001 in words is "eleven trillion, ten billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •