Base | Representation |
---|---|
bin | 10000001010110010110… |
… | …001111100110101111001 |
3 | 10221012221112120001101221 |
4 | 100022302301330311321 |
5 | 121201013324013311 |
6 | 2210233250312041 |
7 | 143163055452121 |
oct | 20126261746571 |
9 | 3835845501357 |
10 | 1111101001081 |
11 | 399240604455 |
12 | 15b409588621 |
13 | 80a12906c76 |
14 | 3bac5949c81 |
15 | 1dd80341671 |
hex | 102b2c7cd79 |
1111101001081 has 2 divisors, whose sum is σ = 1111101001082. Its totient is φ = 1111101001080.
The previous prime is 1111101001033. The next prime is 1111101001103. The reversal of 1111101001081 is 1801001011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 776804263225 + 334296737856 = 881365^2 + 578184^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111101001081 - 219 = 1111100476793 is a prime.
It is a super-2 number, since 2×11111010010812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1111101071081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555550500540 + 555550500541.
It is an arithmetic number, because the mean of its divisors is an integer number (555550500541).
Almost surely, 21111101001081 is an apocalyptic number.
It is an amenable number.
1111101001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111101001081 is an equidigital number, since it uses as much as digits as its factorization.
1111101001081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 1111101001081 its reverse (1801001011111), we get a palindrome (2912102012192).
The spelling of 1111101001081 in words is "one trillion, one hundred eleven billion, one hundred one million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •