Base | Representation |
---|---|
bin | 1100100001000… |
… | …11010001001001 |
3 | 21022120122202002 |
4 | 12100203101021 |
5 | 203340031212 |
6 | 14230320345 |
7 | 2413334306 |
oct | 620432111 |
9 | 238518662 |
10 | 105002057 |
11 | 542a8666 |
12 | 2b1b90b5 |
13 | 189a54c4 |
14 | dd340ad |
15 | 9341ac2 |
hex | 6423449 |
105002057 has 2 divisors, whose sum is σ = 105002058. Its totient is φ = 105002056.
The previous prime is 105002039. The next prime is 105002099. The reversal of 105002057 is 750200501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100721296 + 4280761 = 10036^2 + 2069^2 .
It is an emirp because it is prime and its reverse (750200501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105002057 - 224 = 88224841 is a prime.
It is a super-2 number, since 2×1050020572 = 22050863948462498, which contains 22 as substring.
It is a Chen prime.
It is equal to p6032810 and since 105002057 and 6032810 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (105002957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52501028 + 52501029.
It is an arithmetic number, because the mean of its divisors is an integer number (52501029).
Almost surely, 2105002057 is an apocalyptic number.
It is an amenable number.
105002057 is a deficient number, since it is larger than the sum of its proper divisors (1).
105002057 is an equidigital number, since it uses as much as digits as its factorization.
105002057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 350, while the sum is 20.
The square root of 105002057 is about 10247.0511367905. The cubic root of 105002057 is about 471.7724787406.
Adding to 105002057 its reverse (750200501), we get a palindrome (855202558).
The spelling of 105002057 in words is "one hundred five million, two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.003 sec. • engine limits •