Base | Representation |
---|---|
bin | 1001100110101101010100… |
… | …11010101111001100100011 |
3 | 2202210011112200011002210012 |
4 | 10303112222122233030203 |
5 | 10232022221103031321 |
6 | 112530541302555135 |
7 | 4306646233051121 |
oct | 463265232571443 |
9 | 82704480132705 |
10 | 21121213330211 |
11 | 6803502328a95 |
12 | 2451523738aab |
13 | ba294cc476b7 |
14 | 5303b4c0a911 |
15 | 269627d7305b |
hex | 1335aa6af323 |
21121213330211 has 4 divisors (see below), whose sum is σ = 21121577465472. Its totient is φ = 21120849194952.
The previous prime is 21121213330193. The next prime is 21121213330213. The reversal of 21121213330211 is 11203331212112.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21121213330211 is a prime.
It is a super-2 number, since 2×211212133302112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21121213330213) 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, 181980611 + ... + 182096636.
It is an arithmetic number, because the mean of its divisors is an integer number (5280394366368).
Almost surely, 221121213330211 is an apocalyptic number.
21121213330211 is a deficient number, since it is larger than the sum of its proper divisors (364135261).
21121213330211 is an equidigital number, since it uses as much as digits as its factorization.
21121213330211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364135260.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 21121213330211 its reverse (11203331212112), we get a palindrome (32324544542323).
The spelling of 21121213330211 in words is "twenty-one trillion, one hundred twenty-one billion, two hundred thirteen million, three hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •