Base | Representation |
---|---|
bin | 111101000110000100… |
… | …1011101101100100101 |
3 | 110112122120112022110201 |
4 | 1322030021131230211 |
5 | 4122144234410203 |
6 | 140134513550501 |
7 | 12323160143401 |
oct | 1721411355445 |
9 | 415576468421 |
10 | 131200310053 |
11 | 5070717790a |
12 | 21516875431 |
13 | c4ab777177 |
14 | 64c8a7a101 |
15 | 362d410e1d |
hex | 1e8c25db25 |
131200310053 has 2 divisors, whose sum is σ = 131200310054. Its totient is φ = 131200310052.
The previous prime is 131200310047. The next prime is 131200310141. The reversal of 131200310053 is 350013002131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129230903169 + 1969406884 = 359487^2 + 44378^2 .
It is a cyclic number.
It is not a de Polignac number, because 131200310053 - 229 = 130663439141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131200310053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131200310023) 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, 65600155026 + 65600155027.
It is an arithmetic number, because the mean of its divisors is an integer number (65600155027).
Almost surely, 2131200310053 is an apocalyptic number.
It is an amenable number.
131200310053 is a deficient number, since it is larger than the sum of its proper divisors (1).
131200310053 is an equidigital number, since it uses as much as digits as its factorization.
131200310053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 131200310053 its reverse (350013002131), we get a palindrome (481213312184).
The spelling of 131200310053 in words is "one hundred thirty-one billion, two hundred million, three hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •