Base | Representation |
---|---|
bin | 1100001010100… |
… | …10000000010000 |
3 | 21010000120012200 |
4 | 12011102000100 |
5 | 202111012020 |
6 | 14043123200 |
7 | 2346251223 |
oct | 605220020 |
9 | 233016180 |
10 | 102047760 |
11 | 5266aaa1 |
12 | 2a213500 |
13 | 181ac8b9 |
14 | d7a55ba |
15 | 8e5b590 |
hex | 6152010 |
102047760 has 120 divisors (see below), whose sum is σ = 344632704. Its totient is φ = 27060480.
The previous prime is 102047747. The next prime is 102047789. The reversal of 102047760 is 67740201.
It is a tau number, because it is divible by the number of its divisors (120).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 194859 + ... + 195381.
Almost surely, 2102047760 is an apocalyptic number.
102047760 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 102047760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172316352).
102047760 is an abundant number, since it is smaller than the sum of its proper divisors (242584944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102047760 is a wasteful number, since it uses less digits than its factorization.
102047760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813 (or 804 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 27.
The square root of 102047760 is about 10101.8691339771. The cubic root of 102047760 is about 467.3057864303.
Adding to 102047760 its reverse (67740201), we get a palindrome (169787961).
The spelling of 102047760 in words is "one hundred two million, forty-seven thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •