Base | Representation |
---|---|
bin | 1001010010111101110101… |
… | …0011101011010110001011 |
3 | 1100012011022201212220002211 |
4 | 2110233131103223112023 |
5 | 2314432002132321303 |
6 | 33423355331205551 |
7 | 2103321546326344 |
oct | 224573523532613 |
9 | 40164281786084 |
10 | 10221440120203 |
11 | 3290985525924 |
12 | 1190b977468b7 |
13 | 591b5430a250 |
14 | 274a1288d0cb |
15 | 12ad3a7a066d |
hex | 94bdd4eb58b |
10221440120203 has 16 divisors (see below), whose sum is σ = 11071864148800. Its totient is φ = 9380213216640.
The previous prime is 10221440120147. The next prime is 10221440120279. The reversal of 10221440120203 is 30202104412201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221440120203 is a prime.
It is a super-2 number, since 2×102214401202032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10221440120303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7155193 + ... + 8464021.
It is an arithmetic number, because the mean of its divisors is an integer number (691991509300).
Almost surely, 210221440120203 is an apocalyptic number.
10221440120203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10221440120203 is a deficient number, since it is larger than the sum of its proper divisors (850424028597).
10221440120203 is a wasteful number, since it uses less digits than its factorization.
10221440120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312342.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10221440120203 its reverse (30202104412201), we get a palindrome (40423544532404).
The spelling of 10221440120203 in words is "ten trillion, two hundred twenty-one billion, four hundred forty million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •