Base | Representation |
---|---|
bin | 10000011110010110011… |
… | …011100010101100001111 |
3 | 11000020011000020221120122 |
4 | 100132112123202230033 |
5 | 122022020122414411 |
6 | 2224025112135155 |
7 | 144535332636026 |
oct | 20362633425417 |
9 | 4006130227518 |
10 | 1132100201231 |
11 | 3a713706031a |
12 | 1634aa0974bb |
13 | 829ab2cb99c |
14 | 3cb188118bd |
15 | 1e6adb819db |
hex | 107966e2b0f |
1132100201231 has 2 divisors, whose sum is σ = 1132100201232. Its totient is φ = 1132100201230.
The previous prime is 1132100201201. The next prime is 1132100201233. The reversal of 1132100201231 is 1321020012311.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132100201231 is a prime.
It is a super-2 number, since 2×11321002012312 (a number of 25 digits) contains 22 as substring.
Together with 1132100201233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132100201233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566050100615 + 566050100616.
It is an arithmetic number, because the mean of its divisors is an integer number (566050100616).
Almost surely, 21132100201231 is an apocalyptic number.
1132100201231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132100201231 is an equidigital number, since it uses as much as digits as its factorization.
1132100201231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1132100201231 its reverse (1321020012311), we get a palindrome (2453120213542).
It can be divided in two parts, 1132100 and 201231, that added together give a palindrome (1333331).
The spelling of 1132100201231 in words is "one trillion, one hundred thirty-two billion, one hundred million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •