Base | Representation |
---|---|
bin | 1111101000011… |
… | …00010001000010 |
3 | 100010201200220100 |
4 | 13310030101002 |
5 | 232031402432 |
6 | 21002223230 |
7 | 3151343406 |
oct | 764142102 |
9 | 303650810 |
10 | 131122242 |
11 | 68019099 |
12 | 37ab4b16 |
13 | 2121c534 |
14 | 135b3106 |
15 | b7a107c |
hex | 7d0c442 |
131122242 has 12 divisors (see below), whose sum is σ = 284098230. Its totient is φ = 43707408.
The previous prime is 131122181. The next prime is 131122247. The reversal of 131122242 is 242221131.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 116445681 + 14676561 = 10791^2 + 3831^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 7284569 = 131122242 / (1 + 3 + 1 + 1 + 2 + 2 + 2 + 4 + 2).
It is not an unprimeable number, because it can be changed into a prime (131122247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3642267 + ... + 3642302.
Almost surely, 2131122242 is an apocalyptic number.
131122242 is an abundant number, since it is smaller than the sum of its proper divisors (152975988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131122242 is a wasteful number, since it uses less digits than its factorization.
131122242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7284577 (or 7284574 counting only the distinct ones).
The product of its digits is 192, while the sum is 18.
The square root of 131122242 is about 11450.8620636177. The cubic root of 131122242 is about 508.0332324757.
Adding to 131122242 its reverse (242221131), we get a palindrome (373343373).
The spelling of 131122242 in words is "one hundred thirty-one million, one hundred twenty-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •