Base | Representation |
---|---|
bin | 1000011001000101000… |
… | …1001001111110110111 |
3 | 111210010112101110001120 |
4 | 2012101101021332313 |
5 | 4330230301130143 |
6 | 150121543155023 |
7 | 13262460152520 |
oct | 2062121117667 |
9 | 453115343046 |
10 | 144171114423 |
11 | 56162921146 |
12 | 23b36745a73 |
13 | 10797a9603b |
14 | 6d995a5847 |
15 | 3b3bee7383 |
hex | 2191449fb7 |
144171114423 has 8 divisors (see below), whose sum is σ = 219689317248. Its totient is φ = 82383493944.
The previous prime is 144171114403. The next prime is 144171114541. The reversal of 144171114423 is 324411171441.
144171114423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144171114423 - 214 = 144171098039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144171114403) 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, 3432645561 + ... + 3432645602.
It is an arithmetic number, because the mean of its divisors is an integer number (27461164656).
Almost surely, 2144171114423 is an apocalyptic number.
144171114423 is a deficient number, since it is larger than the sum of its proper divisors (75518202825).
144171114423 is an equidigital number, since it uses as much as digits as its factorization.
144171114423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6865291173.
The product of its digits is 10752, while the sum is 33.
Adding to 144171114423 its reverse (324411171441), we get a palindrome (468582285864).
The spelling of 144171114423 in words is "one hundred forty-four billion, one hundred seventy-one million, one hundred fourteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •