Base | Representation |
---|---|
bin | 10000011101100010001… |
… | …010001010111011100111 |
3 | 11000010212220002022021022 |
4 | 100131202022022323213 |
5 | 122013221121412411 |
6 | 2223402103441355 |
7 | 144504523552061 |
oct | 20354212127347 |
9 | 4003786068238 |
10 | 1131223232231 |
11 | 3a6827029554 |
12 | 1632a445625b |
13 | 8289b70a211 |
14 | 3ca7416c731 |
15 | 1e65bba3edb |
hex | 1076228aee7 |
1131223232231 has 2 divisors, whose sum is σ = 1131223232232. Its totient is φ = 1131223232230.
The previous prime is 1131223232197. The next prime is 1131223232233. The reversal of 1131223232231 is 1322323221311.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131223232231 is a prime.
It is a super-2 number, since 2×11312232322312 (a number of 25 digits) contains 22 as substring.
Together with 1131223232233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131223232231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131223232233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565611616115 + 565611616116.
It is an arithmetic number, because the mean of its divisors is an integer number (565611616116).
Almost surely, 21131223232231 is an apocalyptic number.
1131223232231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131223232231 is an equidigital number, since it uses as much as digits as its factorization.
1131223232231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 26.
Adding to 1131223232231 its reverse (1322323221311), we get a palindrome (2453546453542).
The spelling of 1131223232231 in words is "one trillion, one hundred thirty-one billion, two hundred twenty-three million, two hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •