Base | Representation |
---|---|
bin | 1100110110011110011011… |
… | …1001111111111010010011 |
3 | 1212000211001111010102221202 |
4 | 3031213212321333322103 |
5 | 3323001240434301321 |
6 | 50015124152541415 |
7 | 2655601050125153 |
oct | 315474671777223 |
9 | 55024044112852 |
10 | 14130021400211 |
11 | 4558565791042 |
12 | 17025ab6b186b |
13 | 7b65bc3ac312 |
14 | 36bc7a708763 |
15 | 19784aa8c70b |
hex | cd9e6e7fe93 |
14130021400211 has 4 divisors (see below), whose sum is σ = 14130030745800. Its totient is φ = 14130012054624.
The previous prime is 14130021400147. The next prime is 14130021400217. The reversal of 14130021400211 is 11200412003141.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 14130021400211 - 26 = 14130021400147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14130021400217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1827281 + ... + 5621298.
It is an arithmetic number, because the mean of its divisors is an integer number (3532507686450).
Almost surely, 214130021400211 is an apocalyptic number.
14130021400211 is a deficient number, since it is larger than the sum of its proper divisors (9345589).
14130021400211 is an equidigital number, since it uses as much as digits as its factorization.
14130021400211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9345588.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 14130021400211 its reverse (11200412003141), we get a palindrome (25330433403352).
The spelling of 14130021400211 in words is "fourteen trillion, one hundred thirty billion, twenty-one million, four hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •