Base | Representation |
---|---|
bin | 1111101011010… |
… | …11100000110001 |
3 | 100011110112001111 |
4 | 13311223200301 |
5 | 232131343434 |
6 | 21014433321 |
7 | 3154556662 |
oct | 765534061 |
9 | 304415044 |
10 | 131512369 |
11 | 6826520a |
12 | 38062841 |
13 | 21327c91 |
14 | 13675369 |
15 | b82b964 |
hex | 7d6b831 |
131512369 has 2 divisors, whose sum is σ = 131512370. Its totient is φ = 131512368.
The previous prime is 131512343. The next prime is 131512373. The reversal of 131512369 is 963215131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75082225 + 56430144 = 8665^2 + 7512^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131512369 is a prime.
It is a super-2 number, since 2×1315123692 = 34591006399984322, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131512369.
It is not a weakly prime, because it can be changed into another prime (131512399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65756184 + 65756185.
It is an arithmetic number, because the mean of its divisors is an integer number (65756185).
Almost surely, 2131512369 is an apocalyptic number.
It is an amenable number.
131512369 is a deficient number, since it is larger than the sum of its proper divisors (1).
131512369 is an equidigital number, since it uses as much as digits as its factorization.
131512369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4860, while the sum is 31.
The square root of 131512369 is about 11467.8842425270. The cubic root of 131512369 is about 508.5365827261.
The spelling of 131512369 in words is "one hundred thirty-one million, five hundred twelve thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •