Base | Representation |
---|---|
bin | 10000010100001000101… |
… | …000001011011001011111 |
3 | 10222011211120011200110021 |
4 | 100110020220023121133 |
5 | 121332034042330211 |
6 | 2215012432453011 |
7 | 143666451041464 |
oct | 20241050133137 |
9 | 3864746150407 |
10 | 1121131214431 |
11 | 3a2518385178 |
12 | 1613486aa167 |
13 | 81950942557 |
14 | 3c397ad566b |
15 | 1e26abbb771 |
hex | 10508a0b65f |
1121131214431 has 2 divisors, whose sum is σ = 1121131214432. Its totient is φ = 1121131214430.
The previous prime is 1121131214387. The next prime is 1121131214459. The reversal of 1121131214431 is 1344121311211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1121131214431 - 29 = 1121131213919 is a prime.
It is a super-2 number, since 2×11211312144312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121131214396 and 1121131214405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121131214461) 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, 560565607215 + 560565607216.
It is an arithmetic number, because the mean of its divisors is an integer number (560565607216).
Almost surely, 21121131214431 is an apocalyptic number.
1121131214431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121131214431 is an equidigital number, since it uses as much as digits as its factorization.
1121131214431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 25.
Adding to 1121131214431 its reverse (1344121311211), we get a palindrome (2465252525642).
The spelling of 1121131214431 in words is "one trillion, one hundred twenty-one billion, one hundred thirty-one million, two hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •