Base | Representation |
---|---|
bin | 1111101011010… |
… | …01010000100001 |
3 | 100011110001101120 |
4 | 13311221100201 |
5 | 232131100022 |
6 | 21014322453 |
7 | 3154521033 |
oct | 765512041 |
9 | 304401346 |
10 | 131503137 |
11 | 68259287 |
12 | 38059429 |
13 | 21323a0c |
14 | 13671c53 |
15 | b828d5c |
hex | 7d69421 |
131503137 has 4 divisors (see below), whose sum is σ = 175337520. Its totient is φ = 87668756.
The previous prime is 131503117. The next prime is 131503181. The reversal of 131503137 is 731305131.
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: 731305131 = 3 ⋅243768377.
It is a cyclic number.
It is not a de Polignac number, because 131503137 - 214 = 131486753 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131503117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21917187 + ... + 21917192.
It is an arithmetic number, because the mean of its divisors is an integer number (43834380).
Almost surely, 2131503137 is an apocalyptic number.
It is an amenable number.
131503137 is a deficient number, since it is larger than the sum of its proper divisors (43834383).
131503137 is an equidigital number, since it uses as much as digits as its factorization.
131503137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43834382.
The product of its (nonzero) digits is 945, while the sum is 24.
The square root of 131503137 is about 11467.4817200639. The cubic root of 131503137 is about 508.5246829085.
Adding to 131503137 its reverse (731305131), we get a palindrome (862808268).
The spelling of 131503137 in words is "one hundred thirty-one million, five hundred three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •