Base | Representation |
---|---|
bin | 1111100111101… |
… | …01111000101001 |
3 | 100010120001011001 |
4 | 13303311320221 |
5 | 232020434234 |
6 | 21000235001 |
7 | 3150512215 |
oct | 763657051 |
9 | 303501131 |
10 | 131030569 |
11 | 67a6622a |
12 | 37a6ba61 |
13 | 211b98a7 |
14 | 1358b945 |
15 | b783d14 |
hex | 7cf5e29 |
131030569 has 2 divisors, whose sum is σ = 131030570. Its totient is φ = 131030568.
The previous prime is 131030567. The next prime is 131030587. The reversal of 131030569 is 965030131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125328025 + 5702544 = 11195^2 + 2388^2 .
It is a cyclic number.
It is not a de Polignac number, because 131030569 - 21 = 131030567 is a prime.
It is a super-2 number, since 2×1310305692 = 34338020024927522, which contains 22 as substring.
Together with 131030567, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131030561) 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 as a sum of consecutive naturals, namely, 65515284 + 65515285.
It is an arithmetic number, because the mean of its divisors is an integer number (65515285).
Almost surely, 2131030569 is an apocalyptic number.
It is an amenable number.
131030569 is a deficient number, since it is larger than the sum of its proper divisors (1).
131030569 is an equidigital number, since it uses as much as digits as its factorization.
131030569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 28.
The square root of 131030569 is about 11446.8584773291. The cubic root of 131030569 is about 507.9148091691.
The spelling of 131030569 in words is "one hundred thirty-one million, thirty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •