Base | Representation |
---|---|
bin | 111101001010110111… |
… | …0001001111010000111 |
3 | 110120001202202022101102 |
4 | 1322111232021322013 |
5 | 4123011344021041 |
6 | 140202452250315 |
7 | 12330150265454 |
oct | 1722556117207 |
9 | 416052668342 |
10 | 131360923271 |
11 | 507898a8a06 |
12 | 2156061099b |
13 | c505b20a86 |
14 | 650212882b |
15 | 363c58a09b |
hex | 1e95b89e87 |
131360923271 has 2 divisors, whose sum is σ = 131360923272. Its totient is φ = 131360923270.
The previous prime is 131360923241. The next prime is 131360923273. The reversal of 131360923271 is 172329063131.
It is a strong prime.
It is an emirp because it is prime and its reverse (172329063131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131360923271 - 210 = 131360922247 is a prime.
Together with 131360923273, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131360923273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65680461635 + 65680461636.
It is an arithmetic number, because the mean of its divisors is an integer number (65680461636).
Almost surely, 2131360923271 is an apocalyptic number.
131360923271 is a deficient number, since it is larger than the sum of its proper divisors (1).
131360923271 is an equidigital number, since it uses as much as digits as its factorization.
131360923271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 38.
The spelling of 131360923271 in words is "one hundred thirty-one billion, three hundred sixty million, nine hundred twenty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •