Base | Representation |
---|---|
bin | 11111001100110110011… |
… | …101100110110000101111 |
3 | 21120222022011221211001221 |
4 | 133030312131212300233 |
5 | 240112110204130221 |
6 | 4320553111444211 |
7 | 310622566535140 |
oct | 37146635466057 |
9 | 7528264854057 |
10 | 2144102411311 |
11 | 757343a072a3 |
12 | 2a765b686667 |
13 | 12725a023c83 |
14 | 75abcc8dac7 |
15 | 3ab8de53541 |
hex | 1f336766c2f |
2144102411311 has 8 divisors (see below), whose sum is σ = 2454577211520. Its totient is φ = 1834671225048.
The previous prime is 2144102411293. The next prime is 2144102411329. The reversal of 2144102411311 is 1131142014412.
It is an interprime number because it is at equal distance from previous prime (2144102411293) and next prime (2144102411329).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2144102411311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2144102411371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 260899081 + ... + 260907298.
It is an arithmetic number, because the mean of its divisors is an integer number (306822151440).
Almost surely, 22144102411311 is an apocalyptic number.
2144102411311 is a deficient number, since it is larger than the sum of its proper divisors (310474800209).
2144102411311 is an equidigital number, since it uses as much as digits as its factorization.
2144102411311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521806973.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 2144102411311 its reverse (1131142014412), we get a palindrome (3275244425723).
The spelling of 2144102411311 in words is "two trillion, one hundred forty-four billion, one hundred two million, four hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •