Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …1010110111001111100110 |
3 | 1100010022200122010110212220 |
4 | 2110131203022313033212 |
5 | 2314123112021320402 |
6 | 33410455303053210 |
7 | 2102041205453511 |
oct | 224354312671746 |
9 | 40108618113786 |
10 | 10202211120102 |
11 | 328380822a501 |
12 | 118930ba41206 |
13 | 5900ab5a0691 |
14 | 273b0ab43d78 |
15 | 12a5b257ddbc |
hex | 947632b73e6 |
10202211120102 has 8 divisors (see below), whose sum is σ = 20404422240216. Its totient is φ = 3400737040032.
The previous prime is 10202211120043. The next prime is 10202211120107. The reversal of 10202211120102 is 20102111220201.
It is a sphenic number, since it is the product of 3 distinct primes.
10202211120102 is an admirable number.
It is a super-2 number, since 2×102022111201022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202211120107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850184260003 + ... + 850184260014.
It is an arithmetic number, because the mean of its divisors is an integer number (2550552780027).
Almost surely, 210202211120102 is an apocalyptic number.
10202211120102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202211120102 is a wasteful number, since it uses less digits than its factorization.
10202211120102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1700368520022.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10202211120102 its reverse (20102111220201), we get a palindrome (30304322340303).
The spelling of 10202211120102 in words is "ten trillion, two hundred two billion, two hundred eleven million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •