Base | Representation |
---|---|
bin | 111101000011001111… |
… | …0110000100111010111 |
3 | 110112101221121201011021 |
4 | 1322012132300213113 |
5 | 4122000414314041 |
6 | 140121240022011 |
7 | 12320624030062 |
oct | 1720636604727 |
9 | 415357551137 |
10 | 131105229271 |
11 | 50668536255 |
12 | 214aaa61907 |
13 | c494b66753 |
14 | 64ba1a98d9 |
15 | 3624dcdcd1 |
hex | 1e867b09d7 |
131105229271 has 2 divisors, whose sum is σ = 131105229272. Its totient is φ = 131105229270.
The previous prime is 131105229193. The next prime is 131105229293. The reversal of 131105229271 is 172922501131.
It is a strong prime.
It is an emirp because it is prime and its reverse (172922501131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131105229271 - 29 = 131105228759 is a prime.
It is a super-2 number, since 2×1311052292712 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131105029271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65552614635 + 65552614636.
It is an arithmetic number, because the mean of its divisors is an integer number (65552614636).
Almost surely, 2131105229271 is an apocalyptic number.
131105229271 is a deficient number, since it is larger than the sum of its proper divisors (1).
131105229271 is an equidigital number, since it uses as much as digits as its factorization.
131105229271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 34.
The spelling of 131105229271 in words is "one hundred thirty-one billion, one hundred five million, two hundred twenty-nine thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •