Base | Representation |
---|---|
bin | 1100110111001100101000… |
… | …1111101010111111101111 |
3 | 1212002000001221112011122101 |
4 | 3031303022033222333233 |
5 | 3323202141403204320 |
6 | 50024535054355531 |
7 | 2656520325556126 |
oct | 315631217527757 |
9 | 55060057464571 |
10 | 14142425444335 |
11 | 456285051aa81 |
12 | 1704a917bbba7 |
13 | 7b78181700b6 |
14 | 36c6d5c60abd |
15 | 197d24a1ec0a |
hex | cdcca3eafef |
14142425444335 has 8 divisors (see below), whose sum is σ = 16998327193680. Its totient is φ = 11295662581824.
The previous prime is 14142425444333. The next prime is 14142425444353. The reversal of 14142425444335 is 53344452424141.
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 14142425444335 - 21 = 14142425444333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14142425444333) 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 7 ways as a sum of consecutive naturals, for example, 2284718302 + ... + 2284724491.
It is an arithmetic number, because the mean of its divisors is an integer number (2124790899210).
Almost surely, 214142425444335 is an apocalyptic number.
14142425444335 is a deficient number, since it is larger than the sum of its proper divisors (2855901749345).
14142425444335 is an equidigital number, since it uses as much as digits as its factorization.
14142425444335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4569443417.
The product of its digits is 3686400, while the sum is 46.
Adding to 14142425444335 its reverse (53344452424141), we get a palindrome (67486877868476).
The spelling of 14142425444335 in words is "fourteen trillion, one hundred forty-two billion, four hundred twenty-five million, four hundred forty-four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •