Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …000100001000100111011 |
3 | 10221012222020120200120022 |
4 | 100022303120201010323 |
5 | 121201023421022341 |
6 | 2210234251121055 |
7 | 143163240420041 |
oct | 20126330410473 |
9 | 3835866520508 |
10 | 1111111110971 |
11 | 39924628a134 |
12 | 15b410a4318b |
13 | 80a14a36854 |
14 | 3bac701c391 |
15 | 1dd8118be4b |
hex | 102b362113b |
1111111110971 has 2 divisors, whose sum is σ = 1111111110972. Its totient is φ = 1111111110970.
The previous prime is 1111111110913. The next prime is 1111111111049. The reversal of 1111111110971 is 1790111111111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1111111110971 - 210 = 1111111109947 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1111111110971.
It is not a weakly prime, because it can be changed into another prime (1111111110671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555555555485 + 555555555486.
It is an arithmetic number, because the mean of its divisors is an integer number (555555555486).
Almost surely, 21111111110971 is an apocalyptic number.
1111111110971 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111111110971 is an equidigital number, since it uses as much as digits as its factorization.
1111111110971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 26.
The spelling of 1111111110971 in words is "one trillion, one hundred eleven billion, one hundred eleven million, one hundred ten thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •