Base | Representation |
---|---|
bin | 1001010001101110000000… |
… | …0010001001011110111101 |
3 | 1100010010000022020211020010 |
4 | 2110123200002021132331 |
5 | 2314104110310121341 |
6 | 33405453111213433 |
7 | 2101632532100241 |
oct | 224334002113675 |
9 | 40103008224203 |
10 | 10200011020221 |
11 | 3282889341940 |
12 | 11889b7077279 |
13 | 58cb1a835729 |
14 | 27397c87c421 |
15 | 12a4d4342716 |
hex | 946e00897bd |
10200011020221 has 32 divisors (see below), whose sum is σ = 15017880044160. Its totient is φ = 6106482432000.
The previous prime is 10200011020189. The next prime is 10200011020247. The reversal of 10200011020221 is 12202011000201.
It is not a de Polignac number, because 10200011020221 - 25 = 10200011020189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200011020197 and 10200011020206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200011030221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2090656 + ... + 4977033.
It is an arithmetic number, because the mean of its divisors is an integer number (469308751380).
Almost surely, 210200011020221 is an apocalyptic number.
10200011020221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10200011020221 is a deficient number, since it is larger than the sum of its proper divisors (4817869023939).
10200011020221 is a wasteful number, since it uses less digits than its factorization.
10200011020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7068237.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10200011020221 its reverse (12202011000201), we get a palindrome (22402022020422).
The spelling of 10200011020221 in words is "ten trillion, two hundred billion, eleven million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •