Base | Representation |
---|---|
bin | 10000011111100110010… |
… | …011101001101100100101 |
3 | 11000100121101220112021201 |
4 | 100133212103221230211 |
5 | 122032241204410203 |
6 | 2224410103242501 |
7 | 144613464446602 |
oct | 20374623515445 |
9 | 4010541815251 |
10 | 1133440310053 |
11 | 3a7764562977 |
12 | 163802a49431 |
13 | 82b62b3ab9c |
14 | 3cc047b36a9 |
15 | 1e73b645e1d |
hex | 107e64e9b25 |
1133440310053 has 2 divisors, whose sum is σ = 1133440310054. Its totient is φ = 1133440310052.
The previous prime is 1133440309999. The next prime is 1133440310081. The reversal of 1133440310053 is 3500130443311.
It is an a-pointer prime, because the next prime (1133440310081) can be obtained adding 1133440310053 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1119264550209 + 14175759844 = 1057953^2 + 119062^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1133440310053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133440310083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566720155026 + 566720155027.
It is an arithmetic number, because the mean of its divisors is an integer number (566720155027).
Almost surely, 21133440310053 is an apocalyptic number.
It is an amenable number.
1133440310053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133440310053 is an equidigital number, since it uses as much as digits as its factorization.
1133440310053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 1133440310053 its reverse (3500130443311), we get a palindrome (4633570753364).
The spelling of 1133440310053 in words is "one trillion, one hundred thirty-three billion, four hundred forty million, three hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •