Base | Representation |
---|---|
bin | 10000010100001000000… |
… | …001101001000010100111 |
3 | 10222011210212011102211201 |
4 | 100110020001221002213 |
5 | 121332024001042411 |
6 | 2215011432143331 |
7 | 143666266135141 |
oct | 20241001510247 |
9 | 3864725142751 |
10 | 1121121112231 |
11 | 3a251270524a |
12 | 161345237b47 |
13 | 8194b816313 |
14 | 3c396625c91 |
15 | 1e269d733c1 |
hex | 105080690a7 |
1121121112231 has 2 divisors, whose sum is σ = 1121121112232. Its totient is φ = 1121121112230.
The previous prime is 1121121112183. The next prime is 1121121112277. The reversal of 1121121112231 is 1322111211211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1121121112231 - 27 = 1121121112103 is a prime.
It is a super-2 number, since 2×11211211122312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121121112199 and 1121121112208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121121142231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560560556115 + 560560556116.
It is an arithmetic number, because the mean of its divisors is an integer number (560560556116).
Almost surely, 21121121112231 is an apocalyptic number.
1121121112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121121112231 is an equidigital number, since it uses as much as digits as its factorization.
1121121112231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 19.
Adding to 1121121112231 its reverse (1322111211211), we get a palindrome (2443232323442).
The spelling of 1121121112231 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-one million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •