Base | Representation |
---|---|
bin | 10000100000011010001… |
… | …001110011100010000101 |
3 | 11000102212000122200022202 |
4 | 100200122021303202011 |
5 | 122041031344103013 |
6 | 2225032255004245 |
7 | 144644156066165 |
oct | 20403211634205 |
9 | 4012760580282 |
10 | 1134310144133 |
11 | 3a8070561111 |
12 | 163a06209685 |
13 | 82c71101bca |
14 | 3cc8811a5a5 |
15 | 1e78cbb4858 |
hex | 1081a273885 |
1134310144133 has 2 divisors, whose sum is σ = 1134310144134. Its totient is φ = 1134310144132.
The previous prime is 1134310143997. The next prime is 1134310144147. The reversal of 1134310144133 is 3314410134311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1010270234884 + 124039909249 = 1005122^2 + 352193^2 .
It is a cyclic number.
It is not a de Polignac number, because 1134310144133 - 28 = 1134310143877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1134310144096 and 1134310144105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1134310143133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567155072066 + 567155072067.
It is an arithmetic number, because the mean of its divisors is an integer number (567155072067).
Almost surely, 21134310144133 is an apocalyptic number.
It is an amenable number.
1134310144133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134310144133 is an equidigital number, since it uses as much as digits as its factorization.
1134310144133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 1134310144133 its reverse (3314410134311), we get a palindrome (4448720278444).
The spelling of 1134310144133 in words is "one trillion, one hundred thirty-four billion, three hundred ten million, one hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •