Base | Representation |
---|---|
bin | 10100100010001110101… |
… | …111001010101001010101 |
3 | 11222220102001101202111121 |
4 | 110202032233022221111 |
5 | 141110010331032013 |
6 | 3000134241203541 |
7 | 203644315052125 |
oct | 24421657125125 |
9 | 4886361352447 |
10 | 1411144002133 |
11 | 4a4510001008 |
12 | 1a95a53305b1 |
13 | a30bb610388 |
14 | 4c42a682c85 |
15 | 26a9169658d |
hex | 1488ebcaa55 |
1411144002133 has 2 divisors, whose sum is σ = 1411144002134. Its totient is φ = 1411144002132.
The previous prime is 1411144002131. The next prime is 1411144002187. The reversal of 1411144002133 is 3312004411141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1404265290289 + 6878711844 = 1185017^2 + 82938^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411144002133 - 21 = 1411144002131 is a prime.
Together with 1411144002131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1411144002098 and 1411144002107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1411144002131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705572001066 + 705572001067.
It is an arithmetic number, because the mean of its divisors is an integer number (705572001067).
Almost surely, 21411144002133 is an apocalyptic number.
It is an amenable number.
1411144002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411144002133 is an equidigital number, since it uses as much as digits as its factorization.
1411144002133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1411144002133 its reverse (3312004411141), we get a palindrome (4723148413274).
The spelling of 1411144002133 in words is "one trillion, four hundred eleven billion, one hundred forty-four million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •