Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …00000010011001001011 |
3 | 10112201001002022100212000 |
4 | 32210112310002121023 |
5 | 112400233142320021 |
6 | 2043523104122043 |
7 | 132220304421351 |
oct | 16442664023113 |
9 | 3481032270760 |
10 | 1001110120011 |
11 | 356628622551 |
12 | 142031906323 |
13 | 735342808a1 |
14 | 3664da5b7d1 |
15 | 1b093e4ab26 |
hex | e916d0264b |
1001110120011 has 32 divisors (see below), whose sum is σ = 1547835264000. Its totient is φ = 638296078464.
The previous prime is 1001110120001. The next prime is 1001110120037. The reversal of 1001110120011 is 1100210111001.
It is a de Polignac number, because none of the positive numbers 2k-1001110120011 is a prime.
It is a super-3 number, since 3×10011101200113 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1001110119975 and 1001110120002.
It is not an unprimeable number, because it can be changed into a prime (1001110120001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4282195 + ... + 4509923.
It is an arithmetic number, because the mean of its divisors is an integer number (48369852000).
Almost surely, 21001110120011 is an apocalyptic number.
1001110120011 is a deficient number, since it is larger than the sum of its proper divisors (546725143989).
1001110120011 is a wasteful number, since it uses less digits than its factorization.
1001110120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 234840 (or 234834 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1001110120011 its reverse (1100210111001), we get a palindrome (2101320231012).
The spelling of 1001110120011 in words is "one trillion, one billion, one hundred ten million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •