Base | Representation |
---|---|
bin | 1100001010110… |
… | …11011010111000 |
3 | 21010002112010010 |
4 | 12011123122320 |
5 | 202113230303 |
6 | 14044021520 |
7 | 2346501531 |
oct | 605333270 |
9 | 233075103 |
10 | 102086328 |
11 | 52696a73 |
12 | 2a2318a0 |
13 | 181c4316 |
14 | d7b5688 |
15 | 8e67c03 |
hex | 615b6b8 |
102086328 has 64 divisors (see below), whose sum is σ = 269798400. Its totient is φ = 32123520.
The previous prime is 102086323. The next prime is 102086329. The reversal of 102086328 is 823680201.
It is a junction number, because it is equal to n+sod(n) for n = 102086295 and 102086304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102086323) 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, 42438 + ... + 44778.
It is an arithmetic number, because the mean of its divisors is an integer number (4215600).
Almost surely, 2102086328 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 102086328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134899200).
102086328 is an abundant number, since it is smaller than the sum of its proper divisors (167712072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102086328 is a wasteful number, since it uses less digits than its factorization.
102086328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2452 (or 2448 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
The square root of 102086328 is about 10103.7779072978. Note that the first 3 decimals coincide. The cubic root of 102086328 is about 467.3646503045.
The spelling of 102086328 in words is "one hundred two million, eighty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •