Base | Representation |
---|---|
bin | 101111100011001011… |
… | …0011100101001110110 |
3 | 100202120100210010112210 |
4 | 1133012112130221312 |
5 | 3133111134133420 |
6 | 114524250554250 |
7 | 10243300600311 |
oct | 1370626345166 |
9 | 322510703483 |
10 | 102112021110 |
11 | 3a33a6348a0 |
12 | 17959138986 |
13 | 9824249088 |
14 | 4d29759978 |
15 | 29c98789e0 |
hex | 17c659ca76 |
102112021110 has 128 divisors (see below), whose sum is σ = 270825804288. Its totient is φ = 24433920000.
The previous prime is 102112021079. The next prime is 102112021111. The reversal of 102112021110 is 11120211201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102112021111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11227665 + ... + 11236755.
It is an arithmetic number, because the mean of its divisors is an integer number (2115826596).
Almost surely, 2102112021110 is an apocalyptic number.
102112021110 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 102112021110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135412902144).
102112021110 is an abundant number, since it is smaller than the sum of its proper divisors (168713783178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102112021110 is a wasteful number, since it uses less digits than its factorization.
102112021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9550.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102112021110 its reverse (11120211201), we get a palindrome (113232232311).
The spelling of 102112021110 in words is "one hundred two billion, one hundred twelve million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •