Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …100011110100001001011 |
3 | 10221012200120101110201121 |
4 | 100022230310132201023 |
5 | 121200312224000021 |
6 | 2210215315100111 |
7 | 143160432453610 |
oct | 20125464364113 |
9 | 3835616343647 |
10 | 1111001000011 |
11 | 39919a112141 |
12 | 15b39bba1637 |
13 | 809c7c92b36 |
14 | 3bab6558507 |
15 | 1dd7668b741 |
hex | 102acd1e84b |
1111001000011 has 32 divisors (see below), whose sum is σ = 1291417344000. Its totient is φ = 936130997760.
The previous prime is 1111000999993. The next prime is 1111001000069. The reversal of 1111001000011 is 1100001001111.
It is a happy number.
It is not a de Polignac number, because 1111001000011 - 219 = 1111000475723 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1111000999958 and 1111001000003.
It is not an unprimeable number, because it can be changed into a prime (1111001000071) 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, 238974015 + ... + 238978663.
It is an arithmetic number, because the mean of its divisors is an integer number (40356792000).
Almost surely, 21111001000011 is an apocalyptic number.
1111001000011 is a deficient number, since it is larger than the sum of its proper divisors (180416343989).
1111001000011 is a wasteful number, since it uses less digits than its factorization.
1111001000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6699.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1111001000011 its reverse (1100001001111), we get a palindrome (2211002001122).
It can be divided in two parts, 111100 and 1000011, that added together give a palindrome (1111111).
The spelling of 1111001000011 in words is "one trillion, one hundred eleven billion, one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •