Base | Representation |
---|---|
bin | 11111001001001000100… |
… | …000100100100101010011 |
3 | 21120120222221221001100101 |
4 | 133021020200210211103 |
5 | 240030421203231121 |
6 | 4315053021033231 |
7 | 310421632436314 |
oct | 37111040444523 |
9 | 7516887831311 |
10 | 2140110211411 |
11 | 755685470437 |
12 | 2a69266b5817 |
13 | 126a71c03a03 |
14 | 758209aa60b |
15 | 3aa0871e491 |
hex | 1f248824953 |
2140110211411 has 4 divisors (see below), whose sum is σ = 2140113379392. Its totient is φ = 2140107043432.
The previous prime is 2140110211387. The next prime is 2140110211427. The reversal of 2140110211411 is 1141120110412.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2140110211411 is a prime.
It is a super-2 number, since 2×21401102114112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2140110211471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119080 + ... + 2072293.
It is an arithmetic number, because the mean of its divisors is an integer number (535028344848).
Almost surely, 22140110211411 is an apocalyptic number.
2140110211411 is a deficient number, since it is larger than the sum of its proper divisors (3167981).
2140110211411 is an equidigital number, since it uses as much as digits as its factorization.
2140110211411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167980.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 2140110211411 its reverse (1141120110412), we get a palindrome (3281230321823).
The spelling of 2140110211411 in words is "two trillion, one hundred forty billion, one hundred ten million, two hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •