Base | Representation |
---|---|
bin | 1001101001010010111011… |
… | …01011001110101101110001 |
3 | 2210002200000201222001001221 |
4 | 10310221131223032231301 |
5 | 10240001311222334301 |
6 | 113035443352025041 |
7 | 4316244356234314 |
oct | 464513553165561 |
9 | 83080021861057 |
10 | 21210120121201 |
11 | 6838185952a60 |
12 | 24667b6392181 |
13 | bab14b42602b |
14 | 53480a85697b |
15 | 26bacd25ada1 |
hex | 134a5daceb71 |
21210120121201 has 8 divisors (see below), whose sum is σ = 23145275978784. Its totient is φ = 19276124783520.
The previous prime is 21210120121193. The next prime is 21210120121297. The reversal of 21210120121201 is 10212102101212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21210120121201 - 23 = 21210120121193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21210120121501) 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, 290091756 + ... + 290164861.
It is an arithmetic number, because the mean of its divisors is an integer number (2893159497348).
Almost surely, 221210120121201 is an apocalyptic number.
It is an amenable number.
21210120121201 is a deficient number, since it is larger than the sum of its proper divisors (1935155857583).
21210120121201 is a wasteful number, since it uses less digits than its factorization.
21210120121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580259951.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21210120121201 its reverse (10212102101212), we get a palindrome (31422222222413).
It can be divided in two parts, 212101 and 20121201, that added together give a palindrome (20333302).
The spelling of 21210120121201 in words is "twenty-one trillion, two hundred ten billion, one hundred twenty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •