Base | Representation |
---|---|
bin | 111101000011010100… |
… | …1010110000011000101 |
3 | 110112102010211200102101 |
4 | 1322012221112003011 |
5 | 4122002122112122 |
6 | 140121415312101 |
7 | 12320656434553 |
oct | 1720651260305 |
9 | 415363750371 |
10 | 131108004037 |
11 | 5066a060a4a |
12 | 214ab97b631 |
13 | c4955c871a |
14 | 64ba6ccbd3 |
15 | 362527b027 |
hex | 1e86a560c5 |
131108004037 has 2 divisors, whose sum is σ = 131108004038. Its totient is φ = 131108004036.
The previous prime is 131108004017. The next prime is 131108004067. The reversal of 131108004037 is 730400801131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120014437761 + 11093566276 = 346431^2 + 105326^2 .
It is a cyclic number.
It is not a de Polignac number, because 131108004037 - 27 = 131108003909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131108003996 and 131108004014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131108004017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65554002018 + 65554002019.
It is an arithmetic number, because the mean of its divisors is an integer number (65554002019).
Almost surely, 2131108004037 is an apocalyptic number.
It is an amenable number.
131108004037 is a deficient number, since it is larger than the sum of its proper divisors (1).
131108004037 is an equidigital number, since it uses as much as digits as its factorization.
131108004037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 131108004037 its reverse (730400801131), we get a palindrome (861508805168).
The spelling of 131108004037 in words is "one hundred thirty-one billion, one hundred eight million, four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •