Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …0101100101000111011101 |
3 | 1100010010020111200110211200 |
4 | 2110123211111211013131 |
5 | 2314104301100001341 |
6 | 33405510010310113 |
7 | 2101634662314165 |
oct | 224334525450735 |
9 | 40103214613750 |
10 | 10200100000221 |
11 | 328292459692a |
12 | 1188a20a28339 |
13 | 58cb330bb311 |
14 | 27398a6015a5 |
15 | 12a4dc06bdb6 |
hex | 946e55651dd |
10200100000221 has 24 divisors (see below), whose sum is σ = 14935157153280. Its totient is φ = 6707249457216.
The previous prime is 10200100000193. The next prime is 10200100000243. The reversal of 10200100000221 is 12200000100201.
It is not a de Polignac number, because 10200100000221 - 219 = 10200099475933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200100000271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10604541 + ... + 11526338.
It is an arithmetic number, because the mean of its divisors is an integer number (622298214720).
Almost surely, 210200100000221 is an apocalyptic number.
It is an amenable number.
10200100000221 is a deficient number, since it is larger than the sum of its proper divisors (4735057153059).
10200100000221 is a wasteful number, since it uses less digits than its factorization.
10200100000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22131585 (or 22131582 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10200100000221 its reverse (12200000100201), we get a palindrome (22400100100422).
The spelling of 10200100000221 in words is "ten trillion, two hundred billion, one hundred million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •