Base | Representation |
---|---|
bin | 1100001010100… |
… | …11001100000000 |
3 | 21010000210212020 |
4 | 12011103030000 |
5 | 202111140413 |
6 | 14043201440 |
7 | 2346301320 |
oct | 605231400 |
9 | 233023766 |
10 | 102052608 |
11 | 526736a9 |
12 | 2a216280 |
13 | 181b1b78 |
14 | d7a7280 |
15 | 8e5cc23 |
hex | 6153300 |
102052608 has 144 divisors (see below), whose sum is σ = 318667776. Its totient is φ = 28385280.
The previous prime is 102052607. The next prime is 102052609. The reversal of 102052608 is 806250201.
It is an interprime number because it is at equal distance from previous prime (102052607) and next prime (102052609).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (102052607) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220185 + ... + 220647.
Almost surely, 2102052608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102052608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159333888).
102052608 is an abundant number, since it is smaller than the sum of its proper divisors (216615168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102052608 is an equidigital number, since it uses as much as digits as its factorization.
102052608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530 (or 516 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 102052608 is about 10102.1090867205. The cubic root of 102052608 is about 467.3131864379.
It can be divided in two parts, 1020 and 52608, that added together give a triangular number (53628 = T327).
The spelling of 102052608 in words is "one hundred two million, fifty-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •