Base | Representation |
---|---|
bin | 111101001001110001… |
… | …1010111100111011001 |
3 | 110112222020021220211202 |
4 | 1322103203113213121 |
5 | 4122423040311101 |
6 | 140155112403545 |
7 | 12326226120044 |
oct | 1722343274731 |
9 | 415866256752 |
10 | 131324541401 |
11 | 50770309749 |
12 | 215503a65b5 |
13 | c4cb423041 |
14 | 64db377c5b |
15 | 36392a036b |
hex | 1e938d79d9 |
131324541401 has 2 divisors, whose sum is σ = 131324541402. Its totient is φ = 131324541400.
The previous prime is 131324541367. The next prime is 131324541407. The reversal of 131324541401 is 104145423131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85261080025 + 46063461376 = 291995^2 + 214624^2 .
It is an emirp because it is prime and its reverse (104145423131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131324541401 is a prime.
It is a super-2 number, since 2×1313245414012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131324541407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65662270700 + 65662270701.
It is an arithmetic number, because the mean of its divisors is an integer number (65662270701).
Almost surely, 2131324541401 is an apocalyptic number.
It is an amenable number.
131324541401 is a deficient number, since it is larger than the sum of its proper divisors (1).
131324541401 is an equidigital number, since it uses as much as digits as its factorization.
131324541401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 131324541401 its reverse (104145423131), we get a palindrome (235469964532).
The spelling of 131324541401 in words is "one hundred thirty-one billion, three hundred twenty-four million, five hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •