Base | Representation |
---|---|
bin | 11010001001111110… |
… | …01101010110100101 |
3 | 1100020122002212220122 |
4 | 31010333031112211 |
5 | 212224313303331 |
6 | 10241223411325 |
7 | 1004660525165 |
oct | 150477152645 |
9 | 40218085818 |
10 | 14042322341 |
11 | 5a56585683 |
12 | 287a8b3b45 |
13 | 142a309798 |
14 | 972d725a5 |
15 | 572be317b |
hex | 344fcd5a5 |
14042322341 has 8 divisors (see below), whose sum is σ = 14093574144. Its totient is φ = 13991147280.
The previous prime is 14042322331. The next prime is 14042322353. The reversal of 14042322341 is 14322324041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14042322341 - 222 = 14038128037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14042322341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14042322331) 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 7 ways as a sum of consecutive naturals, for example, 361055 + ... + 398051.
It is an arithmetic number, because the mean of its divisors is an integer number (1761696768).
Almost surely, 214042322341 is an apocalyptic number.
It is an amenable number.
14042322341 is a deficient number, since it is larger than the sum of its proper divisors (51251803).
14042322341 is an equidigital number, since it uses as much as digits as its factorization.
14042322341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38371.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 14042322341 its reverse (14322324041), we get a palindrome (28364646382).
The spelling of 14042322341 in words is "fourteen billion, forty-two million, three hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •