Base | Representation |
---|---|
bin | 1100001010010… |
… | …00001100110001 |
3 | 21002221112010022 |
4 | 12011020030301 |
5 | 202103220401 |
6 | 14042213225 |
7 | 2346023153 |
oct | 605101461 |
9 | 232845108 |
10 | 102007601 |
11 | 52642903 |
12 | 2a1b4215 |
13 | 18197537 |
14 | d794ad3 |
15 | 8e4e71b |
hex | 6148331 |
102007601 has 2 divisors, whose sum is σ = 102007602. Its totient is φ = 102007600.
The previous prime is 102007589. The next prime is 102007603. The reversal of 102007601 is 106700201.
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., 97911025 + 4096576 = 9895^2 + 2024^2 .
It is an emirp because it is prime and its reverse (106700201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102007601 - 26 = 102007537 is a prime.
Together with 102007603, it forms a pair of twin primes.
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 102007601.
It is not a weakly prime, because it can be changed into another prime (102007603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51003800 + 51003801.
It is an arithmetic number, because the mean of its divisors is an integer number (51003801).
Almost surely, 2102007601 is an apocalyptic number.
It is an amenable number.
102007601 is a deficient number, since it is larger than the sum of its proper divisors (1).
102007601 is an equidigital number, since it uses as much as digits as its factorization.
102007601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 102007601 is about 10099.8812369255. The cubic root of 102007601 is about 467.2444785507.
Adding to 102007601 its reverse (106700201), we get a palindrome (208707802).
The spelling of 102007601 in words is "one hundred two million, seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •