Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …001011101101001011011 |
3 | 10221012200111220100001100 |
4 | 100022230301131221123 |
5 | 121200312023210021 |
6 | 2210215250122443 |
7 | 143160422653446 |
oct | 20125461355133 |
9 | 3835614810040 |
10 | 1111000210011 |
11 | 39919972264a |
12 | 15b39b880423 |
13 | 809c7a77393 |
14 | 3bab63d065d |
15 | 1dd76582626 |
hex | 102acc5da5b |
1111000210011 has 24 divisors (see below), whose sum is σ = 1719809189280. Its totient is φ = 689316224256.
The previous prime is 1111000209973. The next prime is 1111000210039. The reversal of 1111000210011 is 1100120001111.
It is not a de Polignac number, because 1111000210011 - 217 = 1111000078939 is a prime.
It is a super-2 number, since 2×11110002100112 (a number of 25 digits) contains 22 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 = 1111000209975 and 1111000210002.
It is not an unprimeable number, because it can be changed into a prime (1111000210091) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72521406 + ... + 72536723.
It is an arithmetic number, because the mean of its divisors is an integer number (71658716220).
Almost surely, 21111000210011 is an apocalyptic number.
1111000210011 is a deficient number, since it is larger than the sum of its proper divisors (608808979269).
1111000210011 is a wasteful number, since it uses less digits than its factorization.
1111000210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145058195 (or 145058192 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1111000210011 its reverse (1100120001111), we get a palindrome (2211120211122).
The spelling of 1111000210011 in words is "one trillion, one hundred eleven billion, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •