Base | Representation |
---|---|
bin | 1100001110110… |
… | …01100101100001 |
3 | 21011001210000000 |
4 | 12013121211201 |
5 | 202231244410 |
6 | 14103050213 |
7 | 2354053263 |
oct | 607314541 |
9 | 234053000 |
10 | 102603105 |
11 | 52a0a260 |
12 | 2a440969 |
13 | 183455c7 |
14 | d8abb33 |
15 | 901adc0 |
hex | 61d9961 |
102603105 has 64 divisors (see below), whose sum is σ = 201680640. Its totient is φ = 49688640.
The previous prime is 102603103. The next prime is 102603107. The reversal of 102603105 is 501306201.
It is an interprime number because it is at equal distance from previous prime (102603103) and next prime (102603107).
It is not a de Polignac number, because 102603105 - 21 = 102603103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102603101) 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 63 ways as a sum of consecutive naturals, for example, 119859 + ... + 120711.
It is an arithmetic number, because the mean of its divisors is an integer number (3151260).
Almost surely, 2102603105 is an apocalyptic number.
102603105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
102603105 is a deficient number, since it is larger than the sum of its proper divisors (99077535).
102603105 is an frugal number, since it uses more digits than its factorization.
102603105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890 (or 872 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 102603105 is about 10129.3190787930. The cubic root of 102603105 is about 468.1519477025.
Adding to 102603105 its reverse (501306201), we get a palindrome (603909306).
The spelling of 102603105 in words is "one hundred two million, six hundred three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •