Base | Representation |
---|---|
bin | 1100001110110… |
… | …00010111000000 |
3 | 21011001112002220 |
4 | 12013120113000 |
5 | 202231114310 |
6 | 14103011040 |
7 | 2354032524 |
oct | 607302700 |
9 | 234045086 |
10 | 102598080 |
11 | 52a06502 |
12 | 2a439a80 |
13 | 18343230 |
14 | d8a9d84 |
15 | 9019670 |
hex | 61d85c0 |
102598080 has 112 divisors (see below), whose sum is σ = 350849184. Its totient is φ = 25251840.
The previous prime is 102598073. The next prime is 102598099. The reversal of 102598080 is 80895201.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8370 + ... + 16590.
It is an arithmetic number, because the mean of its divisors is an integer number (3132582).
Almost surely, 2102598080 is an apocalyptic number.
102598080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102598080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175424592).
102598080 is an abundant number, since it is smaller than the sum of its proper divisors (248251104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102598080 is a wasteful number, since it uses less digits than its factorization.
102598080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8254 (or 8244 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 33.
The square root of 102598080 is about 10129.0710334166. The cubic root of 102598080 is about 468.1443049775.
The spelling of 102598080 in words is "one hundred two million, five hundred ninety-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •