Base | Representation |
---|---|
bin | 11101110011000010001100… |
… | …100011101101000000111011 |
3 | 122012000021222201111111101122 |
4 | 131303002030203231000323 |
5 | 114134112204434231321 |
6 | 1142415420041535455 |
7 | 36414036042036032 |
oct | 3563021443550073 |
9 | 565007881444348 |
10 | 131050400305211 |
11 | 3883618754a422 |
12 | 12846541aa458b |
13 | 5817ccc50ac1a |
14 | 2450c32179719 |
15 | 1023dc58c88ab |
hex | 77308c8ed03b |
131050400305211 has 2 divisors, whose sum is σ = 131050400305212. Its totient is φ = 131050400305210.
The previous prime is 131050400305177. The next prime is 131050400305229. The reversal of 131050400305211 is 112503004050131.
It is a strong prime.
It is an emirp because it is prime and its reverse (112503004050131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131050400305211 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (131050400305291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65525200152605 + 65525200152606.
It is an arithmetic number, because the mean of its divisors is an integer number (65525200152606).
Almost surely, 2131050400305211 is an apocalyptic number.
131050400305211 is a deficient number, since it is larger than the sum of its proper divisors (1).
131050400305211 is an equidigital number, since it uses as much as digits as its factorization.
131050400305211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 131050400305211 its reverse (112503004050131), we get a palindrome (243553404355342).
The spelling of 131050400305211 in words is "one hundred thirty-one trillion, fifty billion, four hundred million, three hundred five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •