Base | Representation |
---|---|
bin | 111101001010110101… |
… | …0110001011111011111 |
3 | 110120001201002021102022 |
4 | 1322111222301133133 |
5 | 4123011132134311 |
6 | 140202421250355 |
7 | 12330136614212 |
oct | 1722552613737 |
9 | 416051067368 |
10 | 131360036831 |
11 | 50789352a11 |
12 | 215602639bb |
13 | c5058a045a |
14 | 6501d77779 |
15 | 363c4625db |
hex | 1e95ab17df |
131360036831 has 4 divisors (see below), whose sum is σ = 138273723000. Its totient is φ = 124446350664.
The previous prime is 131360036777. The next prime is 131360036851. The reversal of 131360036831 is 138630063131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131360036831 is a prime.
It is a super-2 number, since 2×1313600368312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131360036791 and 131360036800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131360036851) 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, 3456843056 + ... + 3456843093.
It is an arithmetic number, because the mean of its divisors is an integer number (34568430750).
Almost surely, 2131360036831 is an apocalyptic number.
131360036831 is a deficient number, since it is larger than the sum of its proper divisors (6913686169).
131360036831 is an equidigital number, since it uses as much as digits as its factorization.
131360036831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6913686168.
The product of its (nonzero) digits is 23328, while the sum is 35.
Adding to 131360036831 its reverse (138630063131), we get a palindrome (269990099962).
The spelling of 131360036831 in words is "one hundred thirty-one billion, three hundred sixty million, thirty-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •