Base | Representation |
---|---|
bin | 111101001100111101… |
… | …0110001100001000101 |
3 | 110120020200020212010011 |
4 | 1322121322301201011 |
5 | 4123132410340401 |
6 | 140213445430221 |
7 | 12331663646365 |
oct | 1723172614105 |
9 | 416220225104 |
10 | 131431340101 |
11 | 50815624136 |
12 | 2158010b371 |
13 | c5175a7239 |
14 | 650b6189a5 |
15 | 3643849451 |
hex | 1e99eb1845 |
131431340101 has 2 divisors, whose sum is σ = 131431340102. Its totient is φ = 131431340100.
The previous prime is 131431339979. The next prime is 131431340129. The reversal of 131431340101 is 101043134131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89559540225 + 41871799876 = 299265^2 + 204626^2 .
It is an emirp because it is prime and its reverse (101043134131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131431340101 - 27 = 131431339973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131431340401) 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, 65715670050 + 65715670051.
It is an arithmetic number, because the mean of its divisors is an integer number (65715670051).
Almost surely, 2131431340101 is an apocalyptic number.
It is an amenable number.
131431340101 is a deficient number, since it is larger than the sum of its proper divisors (1).
131431340101 is an equidigital number, since it uses as much as digits as its factorization.
131431340101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 131431340101 its reverse (101043134131), we get a palindrome (232474474232).
The spelling of 131431340101 in words is "one hundred thirty-one billion, four hundred thirty-one million, three hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •