Base | Representation |
---|---|
bin | 11101101000100100100000… |
… | …110111110110111101001101 |
3 | 122002110112221202121002012112 |
4 | 131220210200313312331031 |
5 | 114040322033013023203 |
6 | 1141105215513513405 |
7 | 36311061646163435 |
oct | 3550444067667515 |
9 | 562415852532175 |
10 | 130331334111053 |
11 | 38589232413979 |
12 | 1274b104112865 |
13 | 5795265c980ba |
14 | 24280da9c92c5 |
15 | 101033ca5d6d8 |
hex | 768920df6f4d |
130331334111053 has 2 divisors, whose sum is σ = 130331334111054. Its totient is φ = 130331334111052.
The previous prime is 130331334110959. The next prime is 130331334111061. The reversal of 130331334111053 is 350111433133031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117630791967529 + 12700542143524 = 10845773^2 + 3563782^2 .
It is a cyclic number.
It is not a de Polignac number, because 130331334111053 - 220 = 130331333062477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130331334111653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65165667055526 + 65165667055527.
It is an arithmetic number, because the mean of its divisors is an integer number (65165667055527).
Almost surely, 2130331334111053 is an apocalyptic number.
It is an amenable number.
130331334111053 is a deficient number, since it is larger than the sum of its proper divisors (1).
130331334111053 is an equidigital number, since it uses as much as digits as its factorization.
130331334111053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14580, while the sum is 32.
Adding to 130331334111053 its reverse (350111433133031), we get a palindrome (480442767244084).
The spelling of 130331334111053 in words is "one hundred thirty trillion, three hundred thirty-one billion, three hundred thirty-four million, one hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •