Base | Representation |
---|---|
bin | 111101000000001010… |
… | …1110010001101111001 |
3 | 110112010202202221201202 |
4 | 1322000111302031321 |
5 | 4121243031310431 |
6 | 140103120023545 |
7 | 12315233303564 |
oct | 1720025621571 |
9 | 415122687652 |
10 | 131002213241 |
11 | 50615374839 |
12 | 21480461bb5 |
13 | c479708213 |
14 | 64aa6314db |
15 | 361ad308cb |
hex | 1e80572379 |
131002213241 has 2 divisors, whose sum is σ = 131002213242. Its totient is φ = 131002213240.
The previous prime is 131002213229. The next prime is 131002213261. The reversal of 131002213241 is 142312200131.
It is an a-pointer prime, because the next prime (131002213261) can be obtained adding 131002213241 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109497457216 + 21504756025 = 330904^2 + 146645^2 .
It is an emirp because it is prime and its reverse (142312200131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131002213241 is a prime.
It is not a weakly prime, because it can be changed into another prime (131002213261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65501106620 + 65501106621.
It is an arithmetic number, because the mean of its divisors is an integer number (65501106621).
Almost surely, 2131002213241 is an apocalyptic number.
It is an amenable number.
131002213241 is a deficient number, since it is larger than the sum of its proper divisors (1).
131002213241 is an equidigital number, since it uses as much as digits as its factorization.
131002213241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131002213241 its reverse (142312200131), we get a palindrome (273314413372).
The spelling of 131002213241 in words is "one hundred thirty-one billion, two million, two hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •