Base | Representation |
---|---|
bin | 1100001010010… |
… | …11010110011100 |
3 | 21002222011211100 |
4 | 12011023112130 |
5 | 202104124013 |
6 | 14042353100 |
7 | 2346105612 |
oct | 605132634 |
9 | 232864740 |
10 | 102020508 |
11 | 52651577 |
12 | 2a1bb790 |
13 | 181a0385 |
14 | d7996b2 |
15 | 8e53473 |
hex | 614b59c |
102020508 has 18 divisors (see below), whose sum is σ = 257885264. Its totient is φ = 34006824.
The previous prime is 102020491. The next prime is 102020531. The reversal of 102020508 is 805020201.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1416916 + ... + 1416987.
Almost surely, 2102020508 is an apocalyptic number.
102020508 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
102020508 is an abundant number, since it is smaller than the sum of its proper divisors (155864756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020508 is a wasteful number, since it uses less digits than its factorization.
102020508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2833913 (or 2833908 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 102020508 is about 10100.5201846242. The cubic root of 102020508 is about 467.2641845010.
Adding to 102020508 its reverse (805020201), we get a palindrome (907040709).
It can be divided in two parts, 1020 and 20508, that added together give a triangular number (21528 = T207).
The spelling of 102020508 in words is "one hundred two million, twenty thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •