Base | Representation |
---|---|
bin | 1001100110101101011111… |
… | …01101110000011011111111 |
3 | 2202210011202212101021010001 |
4 | 10303112233231300123333 |
5 | 10232022411330431421 |
6 | 112530554155455131 |
7 | 4306651362334636 |
oct | 463265755603377 |
9 | 82704685337101 |
10 | 21121302202111 |
11 | 6803548509841 |
12 | 24515494574a7 |
13 | ba2965493017 |
14 | 5303c294251d |
15 | 269630a7a691 |
hex | 1335afb706ff |
21121302202111 has 2 divisors, whose sum is σ = 21121302202112. Its totient is φ = 21121302202110.
The previous prime is 21121302202109. The next prime is 21121302202123. The reversal of 21121302202111 is 11120220312112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21121302202111 - 21 = 21121302202109 is a prime.
It is a super-2 number, since 2×211213022021112 (a number of 27 digits) contains 22 as substring.
Together with 21121302202109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121302202411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560651101055 + 10560651101056.
It is an arithmetic number, because the mean of its divisors is an integer number (10560651101056).
Almost surely, 221121302202111 is an apocalyptic number.
21121302202111 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121302202111 is an equidigital number, since it uses as much as digits as its factorization.
21121302202111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 21121302202111 its reverse (11120220312112), we get a palindrome (32241522514223).
The spelling of 21121302202111 in words is "twenty-one trillion, one hundred twenty-one billion, three hundred two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •