Base | Representation |
---|---|
bin | 11101001000101101110… |
… | …00001100100000011011 |
3 | 10112201001011100202001101 |
4 | 32210112320030200123 |
5 | 112400233432210021 |
6 | 2043523143332231 |
7 | 132220316611243 |
oct | 16442670144033 |
9 | 3481034322041 |
10 | 1001111210011 |
11 | 3566291a7480 |
12 | 142032151077 |
13 | 73534572a63 |
14 | 3664dc62b23 |
15 | 1b0940b3a91 |
hex | e916e0c81b |
1001111210011 has 8 divisors (see below), whose sum is σ = 1092746481984. Its totient is φ = 909580131720.
The previous prime is 1001111209997. The next prime is 1001111210023. The reversal of 1001111210011 is 1100121111001.
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 1001111210011 - 237 = 863672256539 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001111210011.
It is not an unprimeable number, because it can be changed into a prime (1001111210081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26028325 + ... + 26066758.
It is an arithmetic number, because the mean of its divisors is an integer number (136593310248).
Almost surely, 21001111210011 is an apocalyptic number.
1001111210011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001111210011 is a deficient number, since it is larger than the sum of its proper divisors (91635271973).
1001111210011 is a wasteful number, since it uses less digits than its factorization.
1001111210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52096841.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1001111210011 its reverse (1100121111001), we get a palindrome (2101232321012).
The spelling of 1001111210011 in words is "one trillion, one billion, one hundred eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •