Base | Representation |
---|---|
bin | 1100001010111… |
… | …11111010101110 |
3 | 21010010110101102 |
4 | 12011133322232 |
5 | 202114323000 |
6 | 14044243102 |
7 | 2346606326 |
oct | 605377256 |
9 | 233113342 |
10 | 102104750 |
11 | 526a98a0 |
12 | 2a240492 |
13 | 181cc817 |
14 | d7bc286 |
15 | 8e6d3d5 |
hex | 615feae |
102104750 has 64 divisors (see below), whose sum is σ = 211071744. Its totient is φ = 36676000.
The previous prime is 102104741. The next prime is 102104759. The reversal of 102104750 is 57401201.
It is an interprime number because it is at equal distance from previous prime (102104741) and next prime (102104759).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102104759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 294077 + ... + 294423.
It is an arithmetic number, because the mean of its divisors is an integer number (3297996).
Almost surely, 2102104750 is an apocalyptic number.
102104750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102104750 is an abundant number, since it is smaller than the sum of its proper divisors (108966994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102104750 is a wasteful number, since it uses less digits than its factorization.
102104750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482 (or 472 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 20.
The square root of 102104750 is about 10104.6895053732. The cubic root of 102104750 is about 467.3927613941.
Adding to 102104750 its reverse (57401201), we get a palindrome (159505951).
The spelling of 102104750 in words is "one hundred two million, one hundred four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •