Base | Representation |
---|---|
bin | 1100001010101… |
… | …11100101000101 |
3 | 21010001201112111 |
4 | 12011113211011 |
5 | 202112224342 |
6 | 14043421021 |
7 | 2346404626 |
oct | 605274505 |
9 | 233051474 |
10 | 102070597 |
11 | 52686172 |
12 | 2a224771 |
13 | 181ba105 |
14 | d7ada4d |
15 | 8e63217 |
hex | 6157945 |
102070597 has 2 divisors, whose sum is σ = 102070598. Its totient is φ = 102070596.
The previous prime is 102070583. The next prime is 102070621. The reversal of 102070597 is 795070201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85211361 + 16859236 = 9231^2 + 4106^2 .
It is an emirp because it is prime and its reverse (795070201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102070597 - 215 = 102037829 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102070537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51035298 + 51035299.
It is an arithmetic number, because the mean of its divisors is an integer number (51035299).
Almost surely, 2102070597 is an apocalyptic number.
It is an amenable number.
102070597 is a deficient number, since it is larger than the sum of its proper divisors (1).
102070597 is an equidigital number, since it uses as much as digits as its factorization.
102070597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410, while the sum is 31.
The square root of 102070597 is about 10102.9994061170. Note that the first 3 decimals coincide. The cubic root of 102070597 is about 467.3406428749.
It can be divided in two parts, 1020 and 70597, that added together give a palindrome (71617).
The spelling of 102070597 in words is "one hundred two million, seventy thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •