Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100101100010000010011 |
3 | 1100012010110210211121210010 |
4 | 2110233021230230100103 |
5 | 2314430313422230303 |
6 | 33423302540010003 |
7 | 2103310443100515 |
oct | 224571154542023 |
9 | 40163423747703 |
10 | 10221111133203 |
11 | 3290826853043 |
12 | 1190b05530903 |
13 | 591b01100599 |
14 | 2749c0cd1bb5 |
15 | 12ad1b967c03 |
hex | 94bc9b2c413 |
10221111133203 has 24 divisors (see below), whose sum is σ = 14376486866880. Its totient is φ = 6441488277840.
The previous prime is 10221111133201. The next prime is 10221111133217. The reversal of 10221111133203 is 30233111112201.
It is not a de Polignac number, because 10221111133203 - 21 = 10221111133201 is a prime.
It is a super-2 number, since 2×102211111332032 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10221111133203.
It is not an unprimeable number, because it can be changed into a prime (10221111133201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11800788 + ... + 12637278.
It is an arithmetic number, because the mean of its divisors is an integer number (599020286120).
Almost surely, 210221111133203 is an apocalyptic number.
10221111133203 is a deficient number, since it is larger than the sum of its proper divisors (4155375733677).
10221111133203 is an frugal number, since it uses more digits than its factorization.
10221111133203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 837439 (or 836976 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10221111133203 its reverse (30233111112201), we get a palindrome (40454222245404).
The spelling of 10221111133203 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, one hundred thirty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •