Base | Representation |
---|---|
bin | 1100010000000… |
… | …01010001011111 |
3 | 21011101000222200 |
4 | 12020001101133 |
5 | 202302000123 |
6 | 14110342543 |
7 | 2355331230 |
oct | 610012137 |
9 | 234330880 |
10 | 102765663 |
11 | 53010400 |
12 | 2a4baa53 |
13 | 183a15b0 |
14 | d911087 |
15 | 904e143 |
hex | 620145f |
102765663 has 144 divisors (see below), whose sum is σ = 216111168. Its totient is φ = 45619200.
The previous prime is 102765577. The next prime is 102765683. The reversal of 102765663 is 366567201.
It is not a de Polignac number, because 102765663 - 210 = 102764639 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102765683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1684653 + ... + 1684713.
It is an arithmetic number, because the mean of its divisors is an integer number (1500772).
Almost surely, 2102765663 is an apocalyptic number.
102765663 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102765663 is an abundant number, since it is smaller than the sum of its proper divisors (113345505).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102765663 is a wasteful number, since it uses less digits than its factorization.
102765663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The square root of 102765663 is about 10137.3400357293. The cubic root of 102765663 is about 468.3990542246.
The spelling of 102765663 in words is "one hundred two million, seven hundred sixty-five thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •