Base | Representation |
---|---|
bin | 11101001010100100111… |
… | …10100011001010001011 |
3 | 10112210121211212102201002 |
4 | 32211102132203022023 |
5 | 112404310421320021 |
6 | 2044210303045215 |
7 | 132254150655611 |
oct | 16452236431213 |
9 | 3483554772632 |
10 | 1002111120011 |
11 | 356aa1669681 |
12 | 142270ba080b |
13 | 7366377ac91 |
14 | 367069896b1 |
15 | 1b101c7850b |
hex | e9527a328b |
1002111120011 has 8 divisors (see below), whose sum is σ = 1006942092624. Its totient is φ = 997280917920.
The previous prime is 1002111120001. The next prime is 1002111120047. The reversal of 1002111120011 is 1100211112001.
1002111120011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1002111120011 - 226 = 1002044011147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002111119974 and 1002111120001.
It is not an unprimeable number, because it can be changed into a prime (1002111120001) 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, 2505581 + ... + 2877873.
It is an arithmetic number, because the mean of its divisors is an integer number (125867761578).
Almost surely, 21002111120011 is an apocalyptic number.
1002111120011 is a deficient number, since it is larger than the sum of its proper divisors (4830972613).
1002111120011 is a wasteful number, since it uses less digits than its factorization.
1002111120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 385261.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1002111120011 its reverse (1100211112001), we get a palindrome (2102322232012).
The spelling of 1002111120011 in words is "one trillion, two billion, one hundred eleven million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •