Base | Representation |
---|---|
bin | 10000011111010010110… |
… | …011100100010011000111 |
3 | 11000022202121021011200121 |
4 | 100133102303210103013 |
5 | 122031103430212411 |
6 | 2224313414522411 |
7 | 144602412464443 |
oct | 20372263442307 |
9 | 4008677234617 |
10 | 1133113132231 |
11 | 3a7606906383 |
12 | 163731366407 |
13 | 82b10115842 |
14 | 3cbb3167823 |
15 | 1e71ca69571 |
hex | 107d2ce44c7 |
1133113132231 has 2 divisors, whose sum is σ = 1133113132232. Its totient is φ = 1133113132230.
The previous prime is 1133113132201. The next prime is 1133113132253. The reversal of 1133113132231 is 1322313113311.
It is a strong prime.
It is an emirp because it is prime and its reverse (1322313113311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133113132231 - 27 = 1133113132103 is a prime.
It is a super-2 number, since 2×11331131322312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1133113132196 and 1133113132205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133113132201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566556566115 + 566556566116.
It is an arithmetic number, because the mean of its divisors is an integer number (566556566116).
Almost surely, 21133113132231 is an apocalyptic number.
1133113132231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133113132231 is an equidigital number, since it uses as much as digits as its factorization.
1133113132231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972, while the sum is 25.
Adding to 1133113132231 its reverse (1322313113311), we get a palindrome (2455426245542).
The spelling of 1133113132231 in words is "one trillion, one hundred thirty-three billion, one hundred thirteen million, one hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •