Base | Representation |
---|---|
bin | 1000011010110111100… |
… | …1010000000100110101 |
3 | 111211101000002211102210 |
4 | 2012231321100010311 |
5 | 4332221223342224 |
6 | 150241341124033 |
7 | 13310411334621 |
oct | 2065571200465 |
9 | 454330084383 |
10 | 144651387189 |
11 | 56389a34191 |
12 | 2404b559619 |
13 | 10843431bca |
14 | 70032a4181 |
15 | 3b69265429 |
hex | 21ade50135 |
144651387189 has 4 divisors (see below), whose sum is σ = 192868516256. Its totient is φ = 96434258124.
The previous prime is 144651387037. The next prime is 144651387239. The reversal of 144651387189 is 981783156441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 981783156441 = 3 ⋅327261052147.
It is not a de Polignac number, because 144651387189 - 28 = 144651386933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144151387189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24108564529 + ... + 24108564534.
It is an arithmetic number, because the mean of its divisors is an integer number (48217129064).
Almost surely, 2144651387189 is an apocalyptic number.
It is an amenable number.
144651387189 is a deficient number, since it is larger than the sum of its proper divisors (48217129067).
144651387189 is an equidigital number, since it uses as much as digits as its factorization.
144651387189 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48217129066.
The product of its digits is 5806080, while the sum is 57.
The spelling of 144651387189 in words is "one hundred forty-four billion, six hundred fifty-one million, three hundred eighty-seven thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •