Base | Representation |
---|---|
bin | 1100001110000… |
… | …10110101101000 |
3 | 21010220001012000 |
4 | 12013002311220 |
5 | 202220304203 |
6 | 14101051000 |
7 | 2353214523 |
oct | 607026550 |
9 | 233801160 |
10 | 102509928 |
11 | 52956254 |
12 | 2a3b6a60 |
13 | 18312081 |
14 | d885bba |
15 | 8eed4a3 |
hex | 61c2d68 |
102509928 has 32 divisors (see below), whose sum is σ = 284750400. Its totient is φ = 34169904.
The previous prime is 102509923. The next prime is 102509929. The reversal of 102509928 is 829905201.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 102509892 and 102509901.
It is not an unprimeable number, because it can be changed into a prime (102509923) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 237076 + ... + 237507.
It is an arithmetic number, because the mean of its divisors is an integer number (8898450).
Almost surely, 2102509928 is an apocalyptic number.
102509928 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
102509928 is an abundant number, since it is smaller than the sum of its proper divisors (182240472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102509928 is a wasteful number, since it uses less digits than its factorization.
102509928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474598 (or 474588 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The square root of 102509928 is about 10124.7186627580. The cubic root of 102509928 is about 468.0101904421.
The spelling of 102509928 in words is "one hundred two million, five hundred nine thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •