Base | Representation |
---|---|
bin | 10000011110011110001… |
… | …111010011100010100011 |
3 | 11000020111010202221102122 |
4 | 100132132033103202203 |
5 | 122022302142224141 |
6 | 2224050112134455 |
7 | 144541513334144 |
oct | 20363617234243 |
9 | 4006433687378 |
10 | 1132231211171 |
11 | 3a71a4001aa5 |
12 | 163525b3742b |
13 | 829cc4ac068 |
14 | 3cb2bd95acb |
15 | 1e6ba40e64b |
hex | 1079e3d38a3 |
1132231211171 has 2 divisors, whose sum is σ = 1132231211172. Its totient is φ = 1132231211170.
The previous prime is 1132231211129. The next prime is 1132231211203. The reversal of 1132231211171 is 1711121322311.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1711121322311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132231211171 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1132231211171.
It is not a weakly prime, because it can be changed into another prime (1132231214171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566115605585 + 566115605586.
It is an arithmetic number, because the mean of its divisors is an integer number (566115605586).
Almost surely, 21132231211171 is an apocalyptic number.
1132231211171 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132231211171 is an equidigital number, since it uses as much as digits as its factorization.
1132231211171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 504, while the sum is 26.
Adding to 1132231211171 its reverse (1711121322311), we get a palindrome (2843352533482).
The spelling of 1132231211171 in words is "one trillion, one hundred thirty-two billion, two hundred thirty-one million, two hundred eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •