Base | Representation |
---|---|
bin | 1001101001010011000101… |
… | …00000001110010110011001 |
3 | 2210002200020101101022112222 |
4 | 10310221202200032112121 |
5 | 10240001442441402301 |
6 | 113035455404113425 |
7 | 4316246361566660 |
oct | 464514240162631 |
9 | 83080211338488 |
10 | 21210201122201 |
11 | 6838217648233 |
12 | 2466819535875 |
13 | bab162146c10 |
14 | 5348174dddd7 |
15 | 26bad540b31b |
hex | 134a6280e599 |
21210201122201 has 32 divisors (see below), whose sum is σ = 27646422171648. Its totient is φ = 15812475497280.
The previous prime is 21210201122153. The next prime is 21210201122203. The reversal of 21210201122201 is 10222110201212.
It is a de Polignac number, because none of the positive numbers 2k-21210201122201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21210201122201.
It is not an unprimeable number, because it can be changed into a prime (21210201122203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75485705 + ... + 75766166.
It is an arithmetic number, because the mean of its divisors is an integer number (863950692864).
Almost surely, 221210201122201 is an apocalyptic number.
It is an amenable number.
21210201122201 is a deficient number, since it is larger than the sum of its proper divisors (6436221049447).
21210201122201 is a wasteful number, since it uses less digits than its factorization.
21210201122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151251981.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21210201122201 its reverse (10222110201212), we get a palindrome (31432311323413).
The spelling of 21210201122201 in words is "twenty-one trillion, two hundred ten billion, two hundred one million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •