Base | Representation |
---|---|
bin | 10111001111100001110101… |
… | …111110101001100001111110 |
3 | 111101221100100221112211021121 |
4 | 113033201311332221201332 |
5 | 101344302031424031420 |
6 | 1001224121510221154 |
7 | 30350211302043100 |
oct | 2717416576514176 |
9 | 441840327484247 |
10 | 102222201002110 |
11 | 2a6312125a1692 |
12 | b56b4203547ba |
13 | 4506687396907 |
14 | 1b3581c0c7570 |
15 | bc4079d062aa |
hex | 5cf875fa987e |
102222201002110 has 96 divisors (see below), whose sum is σ = 214736413500000. Its totient is φ = 34933843316736.
The previous prime is 102222201002069. The next prime is 102222201002143. The reversal of 102222201002110 is 11200102222201.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 250107901 + ... + 250516279.
It is an arithmetic number, because the mean of its divisors is an integer number (2236837640625).
Almost surely, 2102222201002110 is an apocalyptic number.
102222201002110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102222201002110 is an abundant number, since it is smaller than the sum of its proper divisors (112514212497890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102222201002110 is a wasteful number, since it uses less digits than its factorization.
102222201002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410058 (or 410051 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102222201002110 its reverse (11200102222201), we get a palindrome (113422303224311).
The spelling of 102222201002110 in words is "one hundred two trillion, two hundred twenty-two billion, two hundred one million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •