Base | Representation |
---|---|
bin | 1100110001011011000101… |
… | …0001000100000110100111 |
3 | 1211201112000021222201012022 |
4 | 3030112301101010012213 |
5 | 3320041004331143421 |
6 | 45511211151213355 |
7 | 2646406064404445 |
oct | 314266121040647 |
9 | 54645007881168 |
10 | 14043222131111 |
11 | 45247738724a8 |
12 | 16a980681725b |
13 | 7ab368723464 |
14 | 3679a4945b95 |
15 | 19546a7057ab |
hex | cc5b14441a7 |
14043222131111 has 4 divisors (see below), whose sum is σ = 14782339085400. Its totient is φ = 13304105176824.
The previous prime is 14043222131083. The next prime is 14043222131119. The reversal of 14043222131111 is 11113122234041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14043222131111 - 26 = 14043222131047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14043222131119) 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 3 ways as a sum of consecutive naturals, for example, 369558477116 + ... + 369558477153.
It is an arithmetic number, because the mean of its divisors is an integer number (3695584771350).
Almost surely, 214043222131111 is an apocalyptic number.
14043222131111 is a deficient number, since it is larger than the sum of its proper divisors (739116954289).
14043222131111 is an equidigital number, since it uses as much as digits as its factorization.
14043222131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739116954288.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 14043222131111 its reverse (11113122234041), we get a palindrome (25156344365152).
The spelling of 14043222131111 in words is "fourteen trillion, forty-three billion, two hundred twenty-two million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •