Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …011000101000111110111 |
3 | 10222012022011222022121212 |
4 | 100110103123011013313 |
5 | 121332421424031411 |
6 | 2215042422432035 |
7 | 144004110355052 |
oct | 20242333050767 |
9 | 3865264868555 |
10 | 1121312330231 |
11 | 3a260063a155 |
12 | 16139929261b |
13 | 8197c317272 |
14 | 3c3b3b9da99 |
15 | 1e27ba4568b |
hex | 105136c51f7 |
1121312330231 has 2 divisors, whose sum is σ = 1121312330232. Its totient is φ = 1121312330230.
The previous prime is 1121312330147. The next prime is 1121312330273. The reversal of 1121312330231 is 1320332131211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1320332131211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121312330231 is a prime.
It is a super-2 number, since 2×11213123302312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121312330197 and 1121312330206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121312300231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560656165115 + 560656165116.
It is an arithmetic number, because the mean of its divisors is an integer number (560656165116).
Almost surely, 21121312330231 is an apocalyptic number.
1121312330231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121312330231 is an equidigital number, since it uses as much as digits as its factorization.
1121312330231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1121312330231 its reverse (1320332131211), we get a palindrome (2441644461442).
The spelling of 1121312330231 in words is "one trillion, one hundred twenty-one billion, three hundred twelve million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •