Base | Representation |
---|---|
bin | 1001100110101111100111… |
… | …01010111110110011011011 |
3 | 2202210021201022201111222112 |
4 | 10303113303222332303123 |
5 | 10232032230213401321 |
6 | 112531303244342535 |
7 | 4310021545250663 |
oct | 463276352766333 |
9 | 82707638644875 |
10 | 21122442325211 |
11 | 6803a83039137 |
12 | 2451807244a4b |
13 | ba2ab7751586 |
14 | 5304901271a3 |
15 | 26969abd9a5b |
hex | 1335f3abecdb |
21122442325211 has 4 divisors (see below), whose sum is σ = 21141151309800. Its totient is φ = 21103733340624.
The previous prime is 21122442325199. The next prime is 21122442325217. The reversal of 21122442325211 is 11252324422112.
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 21122442325211 - 210 = 21122442324187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21122442325217) 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 in 3 ways as a sum of consecutive naturals, for example, 9354490601 + ... + 9354492858.
It is an arithmetic number, because the mean of its divisors is an integer number (5285287827450).
Almost surely, 221122442325211 is an apocalyptic number.
21122442325211 is a deficient number, since it is larger than the sum of its proper divisors (18708984589).
21122442325211 is a wasteful number, since it uses less digits than its factorization.
21122442325211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18708984588.
The product of its digits is 15360, while the sum is 32.
Adding to 21122442325211 its reverse (11252324422112), we get a palindrome (32374766747323).
The spelling of 21122442325211 in words is "twenty-one trillion, one hundred twenty-two billion, four hundred forty-two million, three hundred twenty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •