Base | Representation |
---|---|
bin | 1001100011001011110000… |
… | …00110001111011100101001 |
3 | 2202100120221202220010111202 |
4 | 10301211320012033130221 |
5 | 10223031211130342301 |
6 | 112355152314333545 |
7 | 4265131205613125 |
oct | 461457006173451 |
9 | 82316852803452 |
10 | 21000110012201 |
11 | 67671076a2801 |
12 | 2431b6642a2b5 |
13 | b943c02ba348 |
14 | 5285a7140585 |
15 | 2663db0cd66b |
hex | 13197818f729 |
21000110012201 has 4 divisors (see below), whose sum is σ = 22235410601172. Its totient is φ = 19764809423232.
The previous prime is 21000110012197. The next prime is 21000110012237. The reversal of 21000110012201 is 10221001100012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7202116872976 + 13797993139225 = 2683676^2 + 3714565^2 .
It is a cyclic number.
It is not a de Polignac number, because 21000110012201 - 22 = 21000110012197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21000110012261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 617650294460 + ... + 617650294493.
It is an arithmetic number, because the mean of its divisors is an integer number (5558852650293).
Almost surely, 221000110012201 is an apocalyptic number.
It is an amenable number.
21000110012201 is a deficient number, since it is larger than the sum of its proper divisors (1235300588971).
21000110012201 is a wasteful number, since it uses less digits than its factorization.
21000110012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1235300588970.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21000110012201 its reverse (10221001100012), we get a palindrome (31221111112213).
The spelling of 21000110012201 in words is "twenty-one trillion, one hundred ten million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •