Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01000111101111100101 |
3 | 10112121110110111110022111 |
4 | 32203123101013233211 |
5 | 112341211421024031 |
6 | 2043240020001021 |
7 | 132153454116142 |
oct | 16433321075745 |
9 | 3477413443274 |
10 | 1000111111141 |
11 | 35616571638a |
12 | 1419b3230171 |
13 | 734052cc88c |
14 | 365970cb3c9 |
15 | 1b0363b31b1 |
hex | e8db447be5 |
1000111111141 has 2 divisors, whose sum is σ = 1000111111142. Its totient is φ = 1000111111140.
The previous prime is 1000111111067. The next prime is 1000111111151. The reversal of 1000111111141 is 1411111110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 825599390625 + 174511720516 = 908625^2 + 417746^2 .
It is an emirp because it is prime and its reverse (1411111110001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1000111111141 - 221 = 1000109013989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000111111151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500055555570 + 500055555571.
It is an arithmetic number, because the mean of its divisors is an integer number (500055555571).
Almost surely, 21000111111141 is an apocalyptic number.
It is an amenable number.
1000111111141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111111141 is an equidigital number, since it uses as much as digits as its factorization.
1000111111141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1000111111141 its reverse (1411111110001), we get a palindrome (2411222221142).
The spelling of 1000111111141 in words is "one trillion, one hundred eleven million, one hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •