Base | Representation |
---|---|
bin | 101111100010111000… |
… | …0111111001100010110 |
3 | 100202112200022020001002 |
4 | 1133011300333030112 |
5 | 3133101130413420 |
6 | 114523300303302 |
7 | 10243121250500 |
oct | 1370560771426 |
9 | 322480266032 |
10 | 102102201110 |
11 | 3a335037998 |
12 | 179559a1b32 |
13 | 98221bb420 |
14 | 4d28320d70 |
15 | 29c8a89075 |
hex | 17c5c3f316 |
102102201110 has 96 divisors (see below), whose sum is σ = 243778338720. Its totient is φ = 30412827648.
The previous prime is 102102201109. The next prime is 102102201119. The reversal of 102102201110 is 11102201201.
It is a junction number, because it is equal to n+sod(n) for n = 102102201091 and 102102201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102201119) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 363140 + ... + 579719.
It is an arithmetic number, because the mean of its divisors is an integer number (2539357695).
Almost surely, 2102102201110 is an apocalyptic number.
102102201110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102102201110 is an abundant number, since it is smaller than the sum of its proper divisors (141676137610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102201110 is a wasteful number, since it uses less digits than its factorization.
102102201110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 942910 (or 942903 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102102201110 its reverse (11102201201), we get a palindrome (113204402311).
Subtracting from 102102201110 its reverse (11102201201), we obtain a palindrome (90999999909).
The spelling of 102102201110 in words is "one hundred two billion, one hundred two million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •