Base | Representation |
---|---|
bin | 100110100110… |
… | …100001011001 |
3 | 201001010000022 |
4 | 212212201121 |
5 | 10042304012 |
6 | 1000520225 |
7 | 152004131 |
oct | 46464131 |
9 | 21033008 |
10 | 10119257 |
11 | 5791825 |
12 | 3480075 |
13 | 2133c35 |
14 | 14b5ac1 |
15 | d4d472 |
hex | 9a6859 |
10119257 has 2 divisors, whose sum is σ = 10119258. Its totient is φ = 10119256.
The previous prime is 10119253. The next prime is 10119259. The reversal of 10119257 is 75291101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5470921 + 4648336 = 2339^2 + 2156^2 .
It is an emirp because it is prime and its reverse (75291101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10119257 - 22 = 10119253 is a prime.
Together with 10119259, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10119253) 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 as a sum of consecutive naturals, namely, 5059628 + 5059629.
It is an arithmetic number, because the mean of its divisors is an integer number (5059629).
Almost surely, 210119257 is an apocalyptic number.
It is an amenable number.
10119257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10119257 is an equidigital number, since it uses as much as digits as its factorization.
10119257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 26.
The square root of 10119257 is about 3181.0779619494. The cubic root of 10119257 is about 216.2965249001.
The spelling of 10119257 in words is "ten million, one hundred nineteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •