Base | Representation |
---|---|
bin | 11101110101001110110111… |
… | …010101101100000011001011 |
3 | 122012112201212001220212011012 |
4 | 131311032313111230003023 |
5 | 114144101023112010031 |
6 | 1143013035455354135 |
7 | 36430664016336626 |
oct | 3565166725540313 |
9 | 565481761825135 |
10 | 131201441906891 |
11 | 388942455a6304 |
12 | 1286b87552294b |
13 | 5829320802125 |
14 | 245827ddc6dbd |
15 | 1027cb5b55b2b |
hex | 7753b756c0cb |
131201441906891 has 2 divisors, whose sum is σ = 131201441906892. Its totient is φ = 131201441906890.
The previous prime is 131201441906867. The next prime is 131201441906897. The reversal of 131201441906891 is 198609144102131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131201441906891 - 26 = 131201441906827 is a prime.
It is a super-3 number, since 3×1312014419068913 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (131201441906897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600720953445 + 65600720953446.
It is an arithmetic number, because the mean of its divisors is an integer number (65600720953446).
Almost surely, 2131201441906891 is an apocalyptic number.
131201441906891 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201441906891 is an equidigital number, since it uses as much as digits as its factorization.
131201441906891 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 50.
The spelling of 131201441906891 in words is "one hundred thirty-one trillion, two hundred one billion, four hundred forty-one million, nine hundred six thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •