Base | Representation |
---|---|
bin | 1100001010111… |
… | …11010000000100 |
3 | 21010010022122022 |
4 | 12011133100010 |
5 | 202114231040 |
6 | 14044222312 |
7 | 2346565346 |
oct | 605372004 |
9 | 233108568 |
10 | 102102020 |
11 | 526a7839 |
12 | 2a23a998 |
13 | 181cb4c7 |
14 | d7bb296 |
15 | 8e6c6b5 |
hex | 615f404 |
102102020 has 12 divisors (see below), whose sum is σ = 214414284. Its totient is φ = 40840800.
The previous prime is 102102019. The next prime is 102102041. The reversal of 102102020 is 20201201.
It can be written as a sum of positive squares in 2 ways, for example, as 48636676 + 53465344 = 6974^2 + 7312^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102101989 and 102102007.
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 3 ways as a sum of consecutive naturals, for example, 2552531 + ... + 2552570.
It is an arithmetic number, because the mean of its divisors is an integer number (17867857).
Almost surely, 2102102020 is an apocalyptic number.
102102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102102020 is an abundant number, since it is smaller than the sum of its proper divisors (112312264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102020 is a wasteful number, since it uses less digits than its factorization.
102102020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5105110 (or 5105108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 102102020 is about 10104.5544186768. The cubic root of 102102020 is about 467.3885957583.
Adding to 102102020 its reverse (20201201), we get a palindrome (122303221).
The spelling of 102102020 in words is "one hundred two million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.828 sec. • engine limits •