Base | Representation |
---|---|
bin | 10011101010011100… |
… | …111100001100110101 |
3 | 2000111102110000010121 |
4 | 103222130330030311 |
5 | 321220002334331 |
6 | 13411015451541 |
7 | 1345131203314 |
oct | 235234741465 |
9 | 60442400117 |
10 | 21113324341 |
11 | 8a54a1508a |
12 | 4112986bb1 |
13 | 1cb6242335 |
14 | 10440d227b |
15 | 838884c11 |
hex | 4ea73c335 |
21113324341 has 4 divisors (see below), whose sum is σ = 21195477612. Its totient is φ = 21031171072.
The previous prime is 21113324339. The next prime is 21113324347. The reversal of 21113324341 is 14342331112.
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 19454391441 + 1658932900 = 139479^2 + 40730^2 .
It is a cyclic number.
It is not a de Polignac number, because 21113324341 - 21 = 21113324339 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113324347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41076250 + ... + 41076763.
It is an arithmetic number, because the mean of its divisors is an integer number (5298869403).
Almost surely, 221113324341 is an apocalyptic number.
It is an amenable number.
21113324341 is a deficient number, since it is larger than the sum of its proper divisors (82153271).
21113324341 is an equidigital number, since it uses as much as digits as its factorization.
21113324341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82153270.
The product of its digits is 1728, while the sum is 25.
Adding to 21113324341 its reverse (14342331112), we get a palindrome (35455655453).
The spelling of 21113324341 in words is "twenty-one billion, one hundred thirteen million, three hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •