Base | Representation |
---|---|
bin | 1001101001000010001000… |
… | …01001111001111001101001 |
3 | 2210001210202020211001011012 |
4 | 10310201010021321321221 |
5 | 10234324324104121301 |
6 | 113031352442513305 |
7 | 4315505033523545 |
oct | 464410411717151 |
9 | 83053666731135 |
10 | 21201102020201 |
11 | 6834378419224 |
12 | 2464aba205835 |
13 | baa341ca8aac |
14 | 5341d2c8ca25 |
15 | 26b7516a5ebb |
hex | 134844279e69 |
21201102020201 has 4 divisors (see below), whose sum is σ = 21213624822852. Its totient is φ = 21188579217552.
The previous prime is 21201102020179. The next prime is 21201102020207. The reversal of 21201102020201 is 10202020110212.
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 4005782088025 + 17195319932176 = 2001445^2 + 4146724^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201102020201 - 214 = 21201102003817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21201102020207) 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, 6261398786 + ... + 6261402171.
It is an arithmetic number, because the mean of its divisors is an integer number (5303406205713).
Almost surely, 221201102020201 is an apocalyptic number.
It is an amenable number.
21201102020201 is a deficient number, since it is larger than the sum of its proper divisors (12522802651).
21201102020201 is a wasteful number, since it uses less digits than its factorization.
21201102020201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12522802650.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21201102020201 its reverse (10202020110212), we get a palindrome (31403122130413).
The spelling of 21201102020201 in words is "twenty-one trillion, two hundred one billion, one hundred two million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •