Base | Representation |
---|---|
bin | 111101000010001100… |
… | …1100111001001010101 |
3 | 110112022111221101221211 |
4 | 1322010121213021111 |
5 | 4121413000402313 |
6 | 140113551541421 |
7 | 12320021245243 |
oct | 1720431471125 |
9 | 415274841854 |
10 | 131070325333 |
11 | 5064a866422 |
12 | 2149b22a871 |
13 | c48a86562c |
14 | 64b56c1793 |
15 | 3621cd6e3d |
hex | 1e84667255 |
131070325333 has 2 divisors, whose sum is σ = 131070325334. Its totient is φ = 131070325332.
The previous prime is 131070325307. The next prime is 131070325367. The reversal of 131070325333 is 333523070131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115203899889 + 15866425444 = 339417^2 + 125962^2 .
It is an emirp because it is prime and its reverse (333523070131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131070325333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131070325295 and 131070325304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131070325303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65535162666 + 65535162667.
It is an arithmetic number, because the mean of its divisors is an integer number (65535162667).
Almost surely, 2131070325333 is an apocalyptic number.
It is an amenable number.
131070325333 is a deficient number, since it is larger than the sum of its proper divisors (1).
131070325333 is an equidigital number, since it uses as much as digits as its factorization.
131070325333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17010, while the sum is 31.
Adding to 131070325333 its reverse (333523070131), we get a palindrome (464593395464).
The spelling of 131070325333 in words is "one hundred thirty-one billion, seventy million, three hundred twenty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •