Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …1000000101110111110111 |
3 | 1100012010201011012101211100 |
4 | 2110233033020011313313 |
5 | 2314431010230431403 |
6 | 33423315551541143 |
7 | 2103312630134514 |
oct | 224571710056767 |
9 | 40163634171740 |
10 | 10221202202103 |
11 | 32908731a44a2 |
12 | 1190b2bb2a7b3 |
13 | 591b16c37bc9 |
14 | 2749cd03a30b |
15 | 12ad249562a3 |
hex | 94bcf205df7 |
10221202202103 has 192 divisors, whose sum is σ = 16845709795200. Its totient is φ = 5933747404800.
The previous prime is 10221202202093. The next prime is 10221202202143. The reversal of 10221202202103 is 30120220212201.
10221202202103 is a `hidden beast` number, since 10 + 221 + 2 + 0 + 220 + 210 + 3 = 666.
It is not a de Polignac number, because 10221202202103 - 24 = 10221202202087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221202202143) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 8864875575 + ... + 8864876727.
It is an arithmetic number, because the mean of its divisors is an integer number (87738071850).
Almost surely, 210221202202103 is an apocalyptic number.
10221202202103 is a deficient number, since it is larger than the sum of its proper divisors (6624507593097).
10221202202103 is a wasteful number, since it uses less digits than its factorization.
10221202202103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1682 (or 1679 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 10221202202103 its reverse (30120220212201), we get a palindrome (40341422414304).
It can be divided in two parts, 1022120 and 2202103, that added together give a palindrome (3224223).
The spelling of 10221202202103 in words is "ten trillion, two hundred twenty-one billion, two hundred two million, two hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •