Base | Representation |
---|---|
bin | 1001100011001101101000… |
… | …10011011011001101011011 |
3 | 2202100200120011112222010211 |
4 | 10301212310103123031123 |
5 | 10223040243221214321 |
6 | 112355440440151551 |
7 | 4265165222334055 |
oct | 461466423331533 |
9 | 82320504488124 |
10 | 21001120101211 |
11 | 6767585887608 |
12 | 24321a87685b7 |
13 | b9452164a753 |
14 | 5286613568d5 |
15 | 266449b040e1 |
hex | 1319b44db35b |
21001120101211 has 4 divisors (see below), whose sum is σ = 21003583006432. Its totient is φ = 20998657195992.
The previous prime is 21001120101193. The next prime is 21001120101223. The reversal of 21001120101211 is 11210102110012.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21001120101211 - 29 = 21001120100699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21001120101191 and 21001120101200.
It is not an unprimeable number, because it can be changed into a prime (21001120101251) 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, 1231439820 + ... + 1231456873.
It is an arithmetic number, because the mean of its divisors is an integer number (5250895751608).
Almost surely, 221001120101211 is an apocalyptic number.
21001120101211 is a deficient number, since it is larger than the sum of its proper divisors (2462905221).
21001120101211 is an equidigital number, since it uses as much as digits as its factorization.
21001120101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2462905220.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21001120101211 its reverse (11210102110012), we get a palindrome (32211222211223).
The spelling of 21001120101211 in words is "twenty-one trillion, one billion, one hundred twenty million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •