Base | Representation |
---|---|
bin | 10000011101100010101… |
… | …100000001101001111101 |
3 | 11000010220111210012100101 |
4 | 100131202230001221331 |
5 | 122013230404412013 |
6 | 2223403022001101 |
7 | 144504662154322 |
oct | 20354254015175 |
9 | 4003814705311 |
10 | 1131232107133 |
11 | 3a6831040387 |
12 | 1632a7416191 |
13 | 828a04c693b |
14 | 3ca753dcb49 |
15 | 1e65c8588dd |
hex | 10762b01a7d |
1131232107133 has 2 divisors, whose sum is σ = 1131232107134. Its totient is φ = 1131232107132.
The previous prime is 1131232107067. The next prime is 1131232107197. The reversal of 1131232107133 is 3317012321311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1052179474564 + 79052632569 = 1025758^2 + 281163^2 .
It is a cyclic number.
It is not a de Polignac number, because 1131232107133 - 29 = 1131232106621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131232117133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565616053566 + 565616053567.
It is an arithmetic number, because the mean of its divisors is an integer number (565616053567).
Almost surely, 21131232107133 is an apocalyptic number.
It is an amenable number.
1131232107133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131232107133 is an equidigital number, since it uses as much as digits as its factorization.
1131232107133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 1131232107133 its reverse (3317012321311), we get a palindrome (4448244428444).
The spelling of 1131232107133 in words is "one trillion, one hundred thirty-one billion, two hundred thirty-two million, one hundred seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •