Base | Representation |
---|---|
bin | 1001010001101110101111… |
… | …1001111101101010000101 |
3 | 1100010010112012001021012012 |
4 | 2110123223321331222011 |
5 | 2314110012302414341 |
6 | 33405524544304005 |
7 | 2101640501103665 |
oct | 224335371755205 |
9 | 40103465037165 |
10 | 10200210201221 |
11 | 3282980815537 |
12 | 1188a51912005 |
13 | 58cb4cb94001 |
14 | 27399b0ca1a5 |
15 | 12a4e6a890eb |
hex | 946ebe7da85 |
10200210201221 has 8 divisors (see below), whose sum is σ = 10552035093600. Its totient is φ = 9848391542640.
The previous prime is 10200210201199. The next prime is 10200210201229. The reversal of 10200210201221 is 12210201200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10200210201221 - 218 = 10200209939077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200210201196 and 10200210201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200210201229) 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, 1900706 + ... + 4900316.
It is an arithmetic number, because the mean of its divisors is an integer number (1319004386700).
Almost surely, 210200210201221 is an apocalyptic number.
It is an amenable number.
10200210201221 is a deficient number, since it is larger than the sum of its proper divisors (351824892379).
10200210201221 is a wasteful number, since it uses less digits than its factorization.
10200210201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3116899.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10200210201221 its reverse (12210201200201), we get a palindrome (22410411401422).
The spelling of 10200210201221 in words is "ten trillion, two hundred billion, two hundred ten million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •