| Base | Representation |
|---|---|
| bin | 101111100010111000… |
| … | …0010000100011111110 |
| 3 | 100202112122221112001000 |
| 4 | 1133011300100203332 |
| 5 | 3133101103310420 |
| 6 | 114523252231130 |
| 7 | 10243116523602 |
| oct | 1370560204376 |
| 9 | 322478845030 |
| 10 | 102102010110 |
| 11 | 3a334a17441 |
| 12 | 1795590b4a6 |
| 13 | 98221524c9 |
| 14 | 4d282b1502 |
| 15 | 29c8a4c690 |
| hex | 17c5c108fe |
102102010110 has 128 divisors (see below), whose sum is σ = 274555008000. Its totient is φ = 26999533440.
The previous prime is 102102010061. The next prime is 102102010123. The reversal of 102102010110 is 11010201201.
It is a happy number.
102102010110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102102010092 and 102102010101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29245465 + ... + 29248955.
It is an arithmetic number, because the mean of its divisors is an integer number (2144961000).
Almost surely, 2102102010110 is an apocalyptic number.
102102010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102102010110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137277504000).
102102010110 is an abundant number, since it is smaller than the sum of its proper divisors (172452997890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102010110 is a wasteful number, since it uses less digits than its factorization.
102102010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4383 (or 4377 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102102010110 its reverse (11010201201), we get a palindrome (113112211311).
The spelling of 102102010110 in words is "one hundred two billion, one hundred two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •