Base | Representation |
---|---|
bin | 101111011111110111… |
… | …0111110101000010110 |
3 | 100202021121220020121110 |
4 | 1132333232332220112 |
5 | 3132344224324342 |
6 | 114505243355450 |
7 | 10240452201315 |
oct | 1367756765026 |
9 | 322247806543 |
10 | 102001011222 |
11 | 3a292a03490 |
12 | 17927b22b86 |
13 | 980724c156 |
14 | 4d18b0027c |
15 | 29bec4bc9c |
hex | 17bfbbea16 |
102001011222 has 64 divisors (see below), whose sum is σ = 228239182080. Its totient is φ = 30120652800.
The previous prime is 102001011209. The next prime is 102001011289. The reversal of 102001011222 is 222110100201.
102001011222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 102001011198 and 102001011207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2368054 + ... + 2410742.
It is an arithmetic number, because the mean of its divisors is an integer number (3566237220).
Almost surely, 2102001011222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102001011222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114119591040).
102001011222 is an abundant number, since it is smaller than the sum of its proper divisors (126238170858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001011222 is a wasteful number, since it uses less digits than its factorization.
102001011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43629.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102001011222 its reverse (222110100201), we get a palindrome (324111111423).
The spelling of 102001011222 in words is "one hundred two billion, one million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •