Base | Representation |
---|---|
bin | 1001110000000001001110… |
… | …01100011100001011100011 |
3 | 2210220202022111220222012112 |
4 | 10320000213030130023203 |
5 | 10302242420341023321 |
6 | 113333530543545535 |
7 | 4342033203413153 |
oct | 470004714341343 |
9 | 83822274828175 |
10 | 21441134314211 |
11 | 6917152395427 |
12 | 24a35285bb2ab |
13 | bc6b75c766b1 |
14 | 541a83946763 |
15 | 272aee390a5b |
hex | 13802731c2e3 |
21441134314211 has 8 divisors (see below), whose sum is σ = 21792703009584. Its totient is φ = 21089568028320.
The previous prime is 21441134314141. The next prime is 21441134314291. The reversal of 21441134314211 is 11241343114412.
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 21441134314211 - 210 = 21441134313187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21441134314291) 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, 29898401 + ... + 30607133.
It is an arithmetic number, because the mean of its divisors is an integer number (2724087876198).
Almost surely, 221441134314211 is an apocalyptic number.
21441134314211 is a deficient number, since it is larger than the sum of its proper divisors (351568695373).
21441134314211 is an equidigital number, since it uses as much as digits as its factorization.
21441134314211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1204741.
The product of its digits is 9216, while the sum is 32.
Adding to 21441134314211 its reverse (11241343114412), we get a palindrome (32682477428623).
The spelling of 21441134314211 in words is "twenty-one trillion, four hundred forty-one billion, one hundred thirty-four million, three hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •