Base | Representation |
---|---|
bin | 1100001010110… |
… | …10001011000100 |
3 | 21010002021002221 |
4 | 12011122023010 |
5 | 202113044340 |
6 | 14043542124 |
7 | 2346450613 |
oct | 605321304 |
9 | 233067087 |
10 | 102081220 |
11 | 5269314a |
12 | 2a22a944 |
13 | 181c1bb7 |
14 | d7b387a |
15 | 8e6644a |
hex | 615a2c4 |
102081220 has 24 divisors (see below), whose sum is σ = 216783000. Its totient is φ = 40372992.
The previous prime is 102081211. The next prime is 102081223. The reversal of 102081220 is 22180201.
It can be written as a sum of positive squares in 4 ways, for example, as 3992004 + 98089216 = 1998^2 + 9904^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102081194 and 102081203.
It is not an unprimeable number, because it can be changed into a prime (102081223) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 26895 + ... + 30454.
It is an arithmetic number, because the mean of its divisors is an integer number (9032625).
Almost surely, 2102081220 is an apocalyptic number.
102081220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102081220 is an abundant number, since it is smaller than the sum of its proper divisors (114701780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102081220 is a wasteful number, since it uses less digits than its factorization.
102081220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57447 (or 57445 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 102081220 is about 10103.5251273998. The cubic root of 102081220 is about 467.3568551423.
The spelling of 102081220 in words is "one hundred two million, eighty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •