Base | Representation |
---|---|
bin | 111101000011011100… |
… | …1111000111110100101 |
3 | 110112102110000001011221 |
4 | 1322012321320332211 |
5 | 4122004224411123 |
6 | 140122052300341 |
7 | 12321041341144 |
oct | 1720671707645 |
9 | 415373001157 |
10 | 131112341413 |
11 | 50671553759 |
12 | 214b13116b1 |
13 | c496486a11 |
14 | 64bb0db75b |
15 | 362583625d |
hex | 1e86e78fa5 |
131112341413 has 4 divisors (see below), whose sum is σ = 131771197600. Its totient is φ = 130453485228.
The previous prime is 131112341387. The next prime is 131112341443. The reversal of 131112341413 is 314143211131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314143211131 = 91943 ⋅3416717.
It is a cyclic number.
It is not a de Polignac number, because 131112341413 - 225 = 131078786981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131112341443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329427795 + ... + 329428192.
It is an arithmetic number, because the mean of its divisors is an integer number (32942799400).
Almost surely, 2131112341413 is an apocalyptic number.
It is an amenable number.
131112341413 is a deficient number, since it is larger than the sum of its proper divisors (658856187).
131112341413 is an equidigital number, since it uses as much as digits as its factorization.
131112341413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 658856186.
The product of its digits is 864, while the sum is 25.
Adding to 131112341413 its reverse (314143211131), we get a palindrome (445255552544).
The spelling of 131112341413 in words is "one hundred thirty-one billion, one hundred twelve million, three hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •