Base | Representation |
---|---|
bin | 11101110010011101101101… |
… | …001110110001111111010111 |
3 | 122011212112212011212211211212 |
4 | 131302131231032301333113 |
5 | 114132441434311134312 |
6 | 1142345420144252035 |
7 | 36411151110105551 |
oct | 3562355516617727 |
9 | 564775764784755 |
10 | 131011220021207 |
11 | 38820601279119 |
12 | 1283aa2861101b |
13 | 58143c7222616 |
14 | 244cd967ca4d1 |
15 | 1022d80d60822 |
hex | 77276d3b1fd7 |
131011220021207 has 2 divisors, whose sum is σ = 131011220021208. Its totient is φ = 131011220021206.
The previous prime is 131011220021191. The next prime is 131011220021233. The reversal of 131011220021207 is 702120022110131.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (702120022110131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131011220021207 - 24 = 131011220021191 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131011220021287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505610010603 + 65505610010604.
It is an arithmetic number, because the mean of its divisors is an integer number (65505610010604).
Almost surely, 2131011220021207 is an apocalyptic number.
131011220021207 is a deficient number, since it is larger than the sum of its proper divisors (1).
131011220021207 is an equidigital number, since it uses as much as digits as its factorization.
131011220021207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 131011220021207 its reverse (702120022110131), we get a palindrome (833131242131338).
The spelling of 131011220021207 in words is "one hundred thirty-one trillion, eleven billion, two hundred twenty million, twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •