Base | Representation |
---|---|
bin | 10000001101111000101… |
… | …111010010100000000011 |
3 | 10221112111222222001000212 |
4 | 100031320233102200003 |
5 | 121224314040122011 |
6 | 2211543011104335 |
7 | 143341264223633 |
oct | 20157057224003 |
9 | 3845458861025 |
10 | 1114422192131 |
11 | 39a695302446 |
12 | 15bb958a20ab |
13 | 811219c8881 |
14 | 3bd1ca806c3 |
15 | 1dec6bcd08b |
hex | 10378bd2803 |
1114422192131 has 2 divisors, whose sum is σ = 1114422192132. Its totient is φ = 1114422192130.
The previous prime is 1114422192127. The next prime is 1114422192139. The reversal of 1114422192131 is 1312912244111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1114422192131 - 22 = 1114422192127 is a prime.
It is a super-2 number, since 2×11144221921312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1114422192139) 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, 557211096065 + 557211096066.
It is an arithmetic number, because the mean of its divisors is an integer number (557211096066).
Almost surely, 21114422192131 is an apocalyptic number.
1114422192131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114422192131 is an equidigital number, since it uses as much as digits as its factorization.
1114422192131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 32.
The spelling of 1114422192131 in words is "one trillion, one hundred fourteen billion, four hundred twenty-two million, one hundred ninety-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •