Base | Representation |
---|---|
bin | 100000110101010101001111… |
… | …001100000100001111110011 |
3 | 200221021201220012201200120212 |
4 | 200311111033030010033303 |
5 | 122411342131022201003 |
6 | 1231041320252254335 |
7 | 42262505453036600 |
oct | 4065251714041763 |
9 | 627251805650525 |
10 | 144402424022003 |
11 | 420137a6884884 |
12 | 142421a77713ab |
13 | 62761230c40c4 |
14 | 27931867036a7 |
15 | 11a6389aaddd8 |
hex | 83554f3043f3 |
144402424022003 has 12 divisors (see below), whose sum is σ = 171147732440400. Its totient is φ = 121438157126832.
The previous prime is 144402424021951. The next prime is 144402424022009. The reversal of 144402424022003 is 300220424204441.
It is not a de Polignac number, because 144402424022003 - 210 = 144402424020979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144402424022009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27801773303 + ... + 27801778496.
It is an arithmetic number, because the mean of its divisors is an integer number (14262311036700).
Almost surely, 2144402424022003 is an apocalyptic number.
144402424022003 is a deficient number, since it is larger than the sum of its proper divisors (26745308418397).
144402424022003 is an equidigital number, since it uses as much as digits as its factorization.
144402424022003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55603551866 (or 55603551859 counting only the distinct ones).
The product of its (nonzero) digits is 49152, while the sum is 32.
Adding to 144402424022003 its reverse (300220424204441), we get a palindrome (444622848226444).
The spelling of 144402424022003 in words is "one hundred forty-four trillion, four hundred two billion, four hundred twenty-four million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •