Base | Representation |
---|---|
bin | 101101111110100010110110… |
… | …011000010001000000010110 |
3 | 222111222002122221112110020120 |
4 | 231332202312120101000112 |
5 | 203001002311222010402 |
6 | 1554022014033412410 |
7 | 60410125165302006 |
oct | 5576426630210026 |
9 | 874862587473216 |
10 | 202210120110102 |
11 | 59480915216895 |
12 | 1a81981410a106 |
13 | 88aa442694940 |
14 | 37d1044662006 |
15 | 1859e38bc73bc |
hex | b7e8b6611016 |
202210120110102 has 96 divisors (see below), whose sum is σ = 446012444247552. Its totient is φ = 60728626748736.
The previous prime is 202210120110073. The next prime is 202210120110113. The reversal of 202210120110102 is 201011021012202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 493565113 + ... + 493974635.
It is an arithmetic number, because the mean of its divisors is an integer number (4645962960912).
Almost surely, 2202210120110102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 202210120110102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223006222123776).
202210120110102 is an abundant number, since it is smaller than the sum of its proper divisors (243802324137450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202210120110102 is a wasteful number, since it uses less digits than its factorization.
202210120110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410322 (or 409955 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 202210120110102 its reverse (201011021012202), we get a palindrome (403221141122304).
The spelling of 202210120110102 in words is "two hundred two trillion, two hundred ten billion, one hundred twenty million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •