Base | Representation |
---|---|
bin | 100011001110110100110… |
… | …100010111010000111111 |
3 | 22120110021122012010010210 |
4 | 203032310310113100333 |
5 | 304131403123311221 |
6 | 5052123232003503 |
7 | 336630056154663 |
oct | 43166464272077 |
9 | 8513248163123 |
10 | 2421100213311 |
11 | 853867a527aa |
12 | 331285690593 |
13 | 1474024a4120 |
14 | 852790d08a3 |
15 | 42ea201b276 |
hex | 233b4d1743f |
2421100213311 has 16 divisors (see below), whose sum is σ = 3588595189760. Its totient is φ = 1441846280160.
The previous prime is 2421100213309. The next prime is 2421100213313. The reversal of 2421100213311 is 1133120011242.
It is an interprime number because it is at equal distance from previous prime (2421100213309) and next prime (2421100213313).
It is not a de Polignac number, because 2421100213311 - 21 = 2421100213309 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 (2421100213313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1001280931 + ... + 1001283348.
It is an arithmetic number, because the mean of its divisors is an integer number (224287199360).
Almost surely, 22421100213311 is an apocalyptic number.
2421100213311 is a deficient number, since it is larger than the sum of its proper divisors (1167494976449).
2421100213311 is a wasteful number, since it uses less digits than its factorization.
2421100213311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002564326.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 2421100213311 its reverse (1133120011242), we get a palindrome (3554220224553).
The spelling of 2421100213311 in words is "two trillion, four hundred twenty-one billion, one hundred million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •