Base | Representation |
---|---|
bin | 100110101001… |
… | …100011101001 |
3 | 201001202001202 |
4 | 212221203221 |
5 | 10043203224 |
6 | 1001053545 |
7 | 152055311 |
oct | 46514351 |
9 | 21052052 |
10 | 10131689 |
11 | 57a00a7 |
12 | 34872b5 |
13 | 21397a9 |
14 | 14ba441 |
15 | d51eae |
hex | 9a98e9 |
10131689 has 2 divisors, whose sum is σ = 10131690. Its totient is φ = 10131688.
The previous prime is 10131623. The next prime is 10131697. The reversal of 10131689 is 98613101.
It is a happy number.
10131689 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8526400 + 1605289 = 2920^2 + 1267^2 .
It is an emirp because it is prime and its reverse (98613101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131689 is a prime.
It is a super-2 number, since 2×101316892 = 205302243985442, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10131619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065844 + 5065845.
It is an arithmetic number, because the mean of its divisors is an integer number (5065845).
Almost surely, 210131689 is an apocalyptic number.
It is an amenable number.
10131689 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131689 is an equidigital number, since it uses as much as digits as its factorization.
10131689 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 29.
The square root of 10131689 is about 3183.0314167472. The cubic root of 10131689 is about 216.3850655891.
The spelling of 10131689 in words is "ten million, one hundred thirty-one thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •