Base | Representation |
---|---|
bin | 10000011110010111000… |
… | …101101010001110010011 |
3 | 11000020011210000212211212 |
4 | 100132113011222032103 |
5 | 122022030434222011 |
6 | 2224030144530335 |
7 | 144535525532162 |
oct | 20362705521623 |
9 | 4006153025755 |
10 | 1132111242131 |
11 | 3a7142311531 |
12 | 1634b19209ab |
13 | 829b069626c |
14 | 3cb1a0873d9 |
15 | 1e6aeb1308b |
hex | 1079716a393 |
1132111242131 has 2 divisors, whose sum is σ = 1132111242132. Its totient is φ = 1132111242130.
The previous prime is 1132111242107. The next prime is 1132111242191. The reversal of 1132111242131 is 1312421112311.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132111242131 is a prime.
It is a super-2 number, since 2×11321112421312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1132111242097 and 1132111242106.
It is not a weakly prime, because it can be changed into another prime (1132111242191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566055621065 + 566055621066.
It is an arithmetic number, because the mean of its divisors is an integer number (566055621066).
Almost surely, 21132111242131 is an apocalyptic number.
1132111242131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132111242131 is an equidigital number, since it uses as much as digits as its factorization.
1132111242131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 288, while the sum is 23.
Adding to 1132111242131 its reverse (1312421112311), we get a palindrome (2444532354442).
The spelling of 1132111242131 in words is "one trillion, one hundred thirty-two billion, one hundred eleven million, two hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •