Base | Representation |
---|---|
bin | 1111101000010… |
… | …11111110001101 |
3 | 100010201122020201 |
4 | 13310023332031 |
5 | 232031333122 |
6 | 21002213501 |
7 | 3151340035 |
oct | 764137615 |
9 | 303648221 |
10 | 131121037 |
11 | 680181a3 |
12 | 37ab4291 |
13 | 2121bb18 |
14 | 135b28c5 |
15 | b7a0a27 |
hex | 7d0bf8d |
131121037 has 4 divisors (see below), whose sum is σ = 131326236. Its totient is φ = 130915840.
The previous prime is 131121031. The next prime is 131121113. The reversal of 131121037 is 730121131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 124077321 + 7043716 = 11139^2 + 2654^2 .
It is a cyclic number.
It is not a de Polignac number, because 131121037 - 27 = 131120909 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 (131121031) 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 in 3 ways as a sum of consecutive naturals, for example, 101638 + ... + 102919.
It is an arithmetic number, because the mean of its divisors is an integer number (32831559).
Almost surely, 2131121037 is an apocalyptic number.
It is an amenable number.
131121037 is a deficient number, since it is larger than the sum of its proper divisors (205199).
131121037 is an equidigital number, since it uses as much as digits as its factorization.
131121037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205198.
The product of its (nonzero) digits is 126, while the sum is 19.
The square root of 131121037 is about 11450.8094473710. The cubic root of 131121037 is about 508.0316762132.
Adding to 131121037 its reverse (730121131), we get a palindrome (861242168).
The spelling of 131121037 in words is "one hundred thirty-one million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •