Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1101011000000011010001 |
3 | 1102222122100100200100012101 |
4 | 2200032303131120003101 |
5 | 2420401023033031001 |
6 | 35230220013000401 |
7 | 2214343066514404 |
oct | 240166335300321 |
9 | 42878310610171 |
10 | 11011012002001 |
11 | 3565820245010 |
12 | 129a011783101 |
13 | 61b44599157b |
14 | 2a0d15c8bd3b |
15 | 14164d319a01 |
hex | a03b37580d1 |
11011012002001 has 32 divisors (see below), whose sum is σ = 13063005537408. Its totient is φ = 9166098723840.
The previous prime is 11011012001999. The next prime is 11011012002013. The reversal of 11011012002001 is 10020021011011.
It is a cyclic number.
It is not a de Polignac number, because 11011012002001 - 21 = 11011012001999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011012002401) 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 31 ways as a sum of consecutive naturals, for example, 252680851 + ... + 252724423.
It is an arithmetic number, because the mean of its divisors is an integer number (408218923044).
Almost surely, 211011012002001 is an apocalyptic number.
11011012002001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11011012002001 is a deficient number, since it is larger than the sum of its proper divisors (2051993535407).
11011012002001 is a wasteful number, since it uses less digits than its factorization.
11011012002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80161.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11011012002001 its reverse (10020021011011), we get a palindrome (21031033013012).
The spelling of 11011012002001 in words is "eleven trillion, eleven billion, twelve million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •