Base | Representation |
---|---|
bin | 1001101001000010010100… |
… | …00011100001011000101101 |
3 | 2210001211000011002020221020 |
4 | 10310201022003201120231 |
5 | 10234330024424311341 |
6 | 113031410340324353 |
7 | 4315510345111311 |
oct | 464411203413055 |
9 | 83054004066836 |
10 | 21201201010221 |
11 | 683441928a961 |
12 | 2464b273a36b9 |
13 | baa35965797b |
14 | 534202099b41 |
15 | 26b75a20b566 |
hex | 13484a0e162d |
21201201010221 has 8 divisors (see below), whose sum is σ = 28339472720544. Its totient is φ = 14098531653360.
The previous prime is 21201201010147. The next prime is 21201201010237. The reversal of 21201201010221 is 12201010210212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21201201010221 - 213 = 21201201002029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21201201010221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201201010271) 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, 8900586975 + ... + 8900589356.
It is an arithmetic number, because the mean of its divisors is an integer number (3542434090068).
Almost surely, 221201201010221 is an apocalyptic number.
It is an amenable number.
21201201010221 is a deficient number, since it is larger than the sum of its proper divisors (7138271710323).
21201201010221 is a wasteful number, since it uses less digits than its factorization.
21201201010221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17801176731.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21201201010221 its reverse (12201010210212), we get a palindrome (33402211220433).
The spelling of 21201201010221 in words is "twenty-one trillion, two hundred one billion, two hundred one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •