Base | Representation |
---|---|
bin | 111101001011010100… |
… | …0000110111110101111 |
3 | 110120002211100011101102 |
4 | 1322112220012332233 |
5 | 4123024241200011 |
6 | 140204154033315 |
7 | 12330423362165 |
oct | 1722650067657 |
9 | 416084304342 |
10 | 131376115631 |
11 | 50797435182 |
12 | 2156571883b |
13 | c50900cb37 |
14 | 6504161235 |
15 | 363da8b73b |
hex | 1e96a06faf |
131376115631 has 4 divisors (see below), whose sum is σ = 131840342472. Its totient is φ = 130911888792.
The previous prime is 131376115627. The next prime is 131376115679. The reversal of 131376115631 is 136511673131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 136511673131 = 811 ⋅168325121.
It is a cyclic number.
It is not a de Polignac number, because 131376115631 - 22 = 131376115627 is a prime.
It is a super-2 number, since 2×1313761156312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131376118631) 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, 232112996 + ... + 232113561.
It is an arithmetic number, because the mean of its divisors is an integer number (32960085618).
Almost surely, 2131376115631 is an apocalyptic number.
131376115631 is a deficient number, since it is larger than the sum of its proper divisors (464226841).
131376115631 is an equidigital number, since it uses as much as digits as its factorization.
131376115631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464226840.
The product of its digits is 34020, while the sum is 38.
Adding to 131376115631 its reverse (136511673131), we get a palindrome (267887788762).
The spelling of 131376115631 in words is "one hundred thirty-one billion, three hundred seventy-six million, one hundred fifteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •