Base | Representation |
---|---|
bin | 10011101010011100… |
… | …111100001001001111 |
3 | 2000111102102222211002 |
4 | 103222130330021033 |
5 | 321220002332421 |
6 | 13411015450515 |
7 | 1345131202535 |
oct | 235234741117 |
9 | 60442388732 |
10 | 21113324111 |
11 | 8a54a149a0 |
12 | 4112986a3b |
13 | 1cb62421b9 |
14 | 10440d2155 |
15 | 838884b0b |
hex | 4ea73c24f |
21113324111 has 8 divisors (see below), whose sum is σ = 23826949200. Its totient is φ = 18532071040.
The previous prime is 21113324083. The next prime is 21113324119. The reversal of 21113324111 is 11142331112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21113324111 - 230 = 20039582287 is a prime.
It is a super-4 number, since 4×211133241114 (a number of 42 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113324119) 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 7 ways as a sum of consecutive naturals, for example, 33092666 + ... + 33093303.
It is an arithmetic number, because the mean of its divisors is an integer number (2978368650).
Almost surely, 221113324111 is an apocalyptic number.
21113324111 is a deficient number, since it is larger than the sum of its proper divisors (2713625089).
21113324111 is a wasteful number, since it uses less digits than its factorization.
21113324111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66186009.
The product of its digits is 144, while the sum is 20.
Adding to 21113324111 its reverse (11142331112), we get a palindrome (32255655223).
The spelling of 21113324111 in words is "twenty-one billion, one hundred thirteen million, three hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •