Base | Representation |
---|---|
bin | 1001101001010011000101… |
… | …00000001001011011000101 |
3 | 2210002200020101100021212120 |
4 | 10310221202200021123011 |
5 | 10240001442440231041 |
6 | 113035455403440153 |
7 | 4316246361454101 |
oct | 464514240113305 |
9 | 83080211307776 |
10 | 21210201102021 |
11 | 6838217634058 |
12 | 2466819526059 |
13 | bab16213a989 |
14 | 5348174d6901 |
15 | 26bad5405366 |
hex | 134a628096c5 |
21210201102021 has 8 divisors (see below), whose sum is σ = 29044599707424. Its totient is φ = 13757968282320.
The previous prime is 21210201102011. The next prime is 21210201102031. The reversal of 21210201102021 is 12020110201212.
It is an interprime number because it is at equal distance from previous prime (21210201102011) and next prime (21210201102031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21210201102021 - 25 = 21210201101989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210201102011) 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, 95541446295 + ... + 95541446516.
It is an arithmetic number, because the mean of its divisors is an integer number (3630574963428).
Almost surely, 221210201102021 is an apocalyptic number.
It is an amenable number.
21210201102021 is a deficient number, since it is larger than the sum of its proper divisors (7834398605403).
21210201102021 is a wasteful number, since it uses less digits than its factorization.
21210201102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191082892851.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21210201102021 its reverse (12020110201212), we get a palindrome (33230311303233).
The spelling of 21210201102021 in words is "twenty-one trillion, two hundred ten billion, two hundred one million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •