Base | Representation |
---|---|
bin | 1100001110110… |
… | …01000101111101 |
3 | 21011001200020012 |
4 | 12013121011331 |
5 | 202231213320 |
6 | 14103033005 |
7 | 2354044346 |
oct | 607310575 |
9 | 234050205 |
10 | 102601085 |
11 | 52a08794 |
12 | 2a43b765 |
13 | 18344702 |
14 | d8ab0cd |
15 | 901a4c5 |
hex | 61d917d |
102601085 has 8 divisors (see below), whose sum is σ = 125140056. Its totient is φ = 80735040.
The previous prime is 102601073. The next prime is 102601097. The reversal of 102601085 is 580106201.
It is an interprime number because it is at equal distance from previous prime (102601073) and next prime (102601097).
It can be written as a sum of positive squares in 4 ways, for example, as 12313081 + 90288004 = 3509^2 + 9502^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102601085 - 26 = 102601021 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102601085.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167894 + ... + 168503.
It is an arithmetic number, because the mean of its divisors is an integer number (15642507).
Almost surely, 2102601085 is an apocalyptic number.
It is an amenable number.
102601085 is a deficient number, since it is larger than the sum of its proper divisors (22538971).
102601085 is an equidigital number, since it uses as much as digits as its factorization.
102601085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336463.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 102601085 is about 10129.2193677499. The cubic root of 102601085 is about 468.1488754331.
Adding to 102601085 its reverse (580106201), we get a palindrome (682707286).
The spelling of 102601085 in words is "one hundred two million, six hundred one thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •