Base | Representation |
---|---|
bin | 1001100011100000000100… |
… | …11000100101001011011001 |
3 | 2202101122010002222110012202 |
4 | 10301300002120211023121 |
5 | 10223221032110311301 |
6 | 112404155045415545 |
7 | 4265665443224354 |
oct | 461600230451331 |
9 | 82348102873182 |
10 | 21011020010201 |
11 | 67707a6048781 |
12 | 24340b010a5b5 |
13 | b9543b691b70 |
14 | 528d200a329b |
15 | 266828ce066b |
hex | 131c026252d9 |
21011020010201 has 8 divisors (see below), whose sum is σ = 22627716513864. Its totient is φ = 19394389820160.
The previous prime is 21011020010177. The next prime is 21011020010263. The reversal of 21011020010201 is 10201002011012.
It can be written as a sum of positive squares in 4 ways, for example, as 251150320201 + 20759869690000 = 501149^2 + 4556300^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21011020010201 - 26 = 21011020010137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21011020019201) 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, 15919370 + ... + 17188611.
It is an arithmetic number, because the mean of its divisors is an integer number (2828464564233).
Almost surely, 221011020010201 is an apocalyptic number.
It is an amenable number.
21011020010201 is a deficient number, since it is larger than the sum of its proper divisors (1616696503663).
21011020010201 is a wasteful number, since it uses less digits than its factorization.
21011020010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33156811.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21011020010201 its reverse (10201002011012), we get a palindrome (31212022021213).
The spelling of 21011020010201 in words is "twenty-one trillion, eleven billion, twenty million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •