Base | Representation |
---|---|
bin | 1001010001101111000101… |
… | …1100110011010111111101 |
3 | 1100010010202200002010021100 |
4 | 2110123301130303113331 |
5 | 2314110210111021341 |
6 | 33405542110123313 |
7 | 2101643010542262 |
oct | 224336134632775 |
9 | 40103680063240 |
10 | 10200303220221 |
11 | 3282a19279044 |
12 | 1188a78ab0539 |
13 | 58cb6623213a |
14 | 2739a95c1269 |
15 | 12a4eed103b6 |
hex | 946f17335fd |
10200303220221 has 12 divisors (see below), whose sum is σ = 14770884097372. Its totient is φ = 6783073171776.
The previous prime is 10200303220193. The next prime is 10200303220231. The reversal of 10200303220221 is 12202230300201.
It can be written as a sum of positive squares in 2 ways, for example, as 3189299511321 + 7011003708900 = 1785861^2 + 2647830^2 .
It is not a de Polignac number, because 10200303220221 - 26 = 10200303220157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200303220194 and 10200303220203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200303220231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1427410816 + ... + 1427417961.
Almost surely, 210200303220221 is an apocalyptic number.
It is an amenable number.
10200303220221 is a deficient number, since it is larger than the sum of its proper divisors (4570580877151).
10200303220221 is a wasteful number, since it uses less digits than its factorization.
10200303220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2854829180 (or 2854829177 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10200303220221 its reverse (12202230300201), we get a palindrome (22402533520422).
The spelling of 10200303220221 in words is "ten trillion, two hundred billion, three hundred three million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •