Base | Representation |
---|---|
bin | 111101010000001101… |
… | …0001111001010111001 |
3 | 110120112021012010020001 |
4 | 1322200122033022321 |
5 | 4123343301020241 |
6 | 140232340033001 |
7 | 12334455454663 |
oct | 1724032171271 |
9 | 416467163201 |
10 | 131540251321 |
11 | 50871051806 |
12 | 215b0692761 |
13 | c53401ab4b |
14 | 651bc89533 |
15 | 364d1ae431 |
hex | 1ea068f2b9 |
131540251321 has 2 divisors, whose sum is σ = 131540251322. Its totient is φ = 131540251320.
The previous prime is 131540251313. The next prime is 131540251363. The reversal of 131540251321 is 123152045131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76695763600 + 54844487721 = 276940^2 + 234189^2 .
It is a cyclic number.
It is not a de Polignac number, because 131540251321 - 23 = 131540251313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131540251321.
It is not a weakly prime, because it can be changed into another prime (131540252321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65770125660 + 65770125661.
It is an arithmetic number, because the mean of its divisors is an integer number (65770125661).
Almost surely, 2131540251321 is an apocalyptic number.
It is an amenable number.
131540251321 is a deficient number, since it is larger than the sum of its proper divisors (1).
131540251321 is an equidigital number, since it uses as much as digits as its factorization.
131540251321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 131540251321 its reverse (123152045131), we get a palindrome (254692296452).
The spelling of 131540251321 in words is "one hundred thirty-one billion, five hundred forty million, two hundred fifty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.675 sec. • engine limits •