Base | Representation |
---|---|
bin | 11010010101111001… |
… | …01001011010011101 |
3 | 1100111121020222212122 |
4 | 31022330221122131 |
5 | 212430413023031 |
6 | 10255154512325 |
7 | 1010313454364 |
oct | 151274513235 |
9 | 40447228778 |
10 | 14142314141 |
11 | 5aa7a70a2a |
12 | 28a82956a5 |
13 | 1444c49627 |
14 | 9823607db |
15 | 57b89547b |
hex | 34af2969d |
14142314141 has 8 divisors (see below), whose sum is σ = 14460265344. Its totient is φ = 13827876480.
The previous prime is 14142314119. The next prime is 14142314167. The reversal of 14142314141 is 14141324141.
It is a happy number.
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 14142314141 - 26 = 14142314077 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14142314141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14142314341) 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, 870245 + ... + 886346.
It is an arithmetic number, because the mean of its divisors is an integer number (1807533168).
Almost surely, 214142314141 is an apocalyptic number.
It is an amenable number.
14142314141 is a deficient number, since it is larger than the sum of its proper divisors (317951203).
14142314141 is an equidigital number, since it uses as much as digits as its factorization.
14142314141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1756771.
The product of its digits is 1536, while the sum is 26.
Adding to 14142314141 its reverse (14141324141), we get a palindrome (28283638282).
The spelling of 14142314141 in words is "fourteen billion, one hundred forty-two million, three hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •