Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …100100111100101001110100 |
3 | 111101012011112100121111200222 |
4 | 113030131100210330221310 |
5 | 101332322233222011241 |
6 | 1000543132302153512 |
7 | 30326026440053543 |
oct | 2714352044745164 |
9 | 441164470544628 |
10 | 102011120110196 |
11 | 2a55a744972380 |
12 | b536531882898 |
13 | 44bc7b8469a7b |
14 | 1b295164ba15a |
15 | bbd823b64a4b |
hex | 5cc75093ca74 |
102011120110196 has 12 divisors (see below), whose sum is σ = 194748502028640. Its totient is φ = 46368690959160.
The previous prime is 102011120110189. The next prime is 102011120110199. The reversal of 102011120110196 is 691011021110201.
It is a super-2 number, since 2×1020111201101962 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011120110199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1159217273936 + ... + 1159217274023.
It is an arithmetic number, because the mean of its divisors is an integer number (16229041835720).
Almost surely, 2102011120110196 is an apocalyptic number.
It is an amenable number.
102011120110196 is a deficient number, since it is larger than the sum of its proper divisors (92737381918444).
102011120110196 is a wasteful number, since it uses less digits than its factorization.
102011120110196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2318434547974 (or 2318434547972 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 26.
Adding to 102011120110196 its reverse (691011021110201), we get a palindrome (793022141220397).
The spelling of 102011120110196 in words is "one hundred two trillion, eleven billion, one hundred twenty million, one hundred ten thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •