Base | Representation |
---|---|
bin | 101111100110011011… |
… | …0100011010010100100 |
3 | 100202211222000220220221 |
4 | 1133030312203102210 |
5 | 3133322100201241 |
6 | 114543144534124 |
7 | 10246064005165 |
oct | 1371466432244 |
9 | 322758026827 |
10 | 102221100196 |
11 | 3a3961675a6 |
12 | 17989781344 |
13 | 9840a1b207 |
14 | 4d3a03176c |
15 | 29d42235d1 |
hex | 17ccda34a4 |
102221100196 has 24 divisors (see below), whose sum is σ = 185079121920. Its totient is φ = 49341802272.
The previous prime is 102221100193. The next prime is 102221100199. The reversal of 102221100196 is 691001122201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102221100193) and next prime (102221100199).
It is a self number, because there is not a number n which added to its sum of digits gives 102221100196.
It is not an unprimeable number, because it can be changed into a prime (102221100193) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 927691 + ... + 1032013.
It is an arithmetic number, because the mean of its divisors is an integer number (7711630080).
Almost surely, 2102221100196 is an apocalyptic number.
It is an amenable number.
102221100196 is a deficient number, since it is larger than the sum of its proper divisors (82858021724).
102221100196 is a wasteful number, since it uses less digits than its factorization.
102221100196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112803 (or 112801 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 102221100196 its reverse (691001122201), we get a palindrome (793222222397).
The spelling of 102221100196 in words is "one hundred two billion, two hundred twenty-one million, one hundred thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •