Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100001011110010001001 |
3 | 1100012010110210120212100010 |
4 | 2110233021230023302021 |
5 | 2314430313404001301 |
6 | 33423302533102133 |
7 | 2103310442004663 |
oct | 224571154136211 |
9 | 40163423525303 |
10 | 10221111000201 |
11 | 3290826772122 |
12 | 1190b05487949 |
13 | 591b01084b9a |
14 | 2749c0c99533 |
15 | 12ad1b93d5d6 |
hex | 94bc9b0bc89 |
10221111000201 has 8 divisors (see below), whose sum is σ = 14067765677824. Its totient is φ = 6594265161360.
The previous prime is 10221111000193. The next prime is 10221111000223. The reversal of 10221111000201 is 10200011112201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10221111000201 - 23 = 10221111000193 is a prime.
It is a super-2 number, since 2×102211110002012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10221111000101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54952209586 + ... + 54952209771.
It is an arithmetic number, because the mean of its divisors is an integer number (1758470709728).
Almost surely, 210221111000201 is an apocalyptic number.
It is an amenable number.
10221111000201 is a deficient number, since it is larger than the sum of its proper divisors (3846654677623).
10221111000201 is a wasteful number, since it uses less digits than its factorization.
10221111000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109904419391.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10221111000201 its reverse (10200011112201), we get a palindrome (20421122112402).
The spelling of 10221111000201 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •