Base | Representation |
---|---|
bin | 1100001100001… |
… | …01111100010101 |
3 | 21010102101000222 |
4 | 12012011330111 |
5 | 202134314001 |
6 | 14051444125 |
7 | 2351125400 |
oct | 606057425 |
9 | 233371028 |
10 | 102260501 |
11 | 527a5912 |
12 | 2a2b6645 |
13 | 18255695 |
14 | d81cd37 |
15 | 8e9e61b |
hex | 6185f15 |
102260501 has 6 divisors (see below), whose sum is σ = 118956150. Its totient is φ = 87651816.
The previous prime is 102260443. The next prime is 102260503. The reversal of 102260501 is 105062201.
It can be written as a sum of positive squares in only one way, i.e., 51480625 + 50779876 = 7175^2 + 7126^2 .
It is not a de Polignac number, because 102260501 - 214 = 102244117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102260501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102260503) 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 in 5 ways as a sum of consecutive naturals, for example, 1043426 + ... + 1043523.
It is an arithmetic number, because the mean of its divisors is an integer number (19826025).
Almost surely, 2102260501 is an apocalyptic number.
It is an amenable number.
102260501 is a deficient number, since it is larger than the sum of its proper divisors (16695649).
102260501 is an equidigital number, since it uses as much as digits as its factorization.
102260501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2086963 (or 2086956 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 102260501 is about 10112.3934357797. The cubic root of 102260501 is about 467.6302949285.
The spelling of 102260501 in words is "one hundred two million, two hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •