Base | Representation |
---|---|
bin | 1000011001111110010… |
… | …0010101100001001001 |
3 | 111210202020211002100110 |
4 | 2012133210111201021 |
5 | 4331223210222213 |
6 | 150201433224533 |
7 | 13301432305635 |
oct | 2063744254111 |
9 | 453666732313 |
10 | 144411023433 |
11 | 56276292356 |
12 | 23ba2b62149 |
13 | 108056b4631 |
14 | 6dbd3b5dc5 |
15 | 3b530d65c3 |
hex | 219f915849 |
144411023433 has 8 divisors (see below), whose sum is σ = 192560973088. Its totient is φ = 96267544704.
The previous prime is 144411023417. The next prime is 144411023459. The reversal of 144411023433 is 334320114441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144411023433 - 24 = 144411023417 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 144411023433.
It is not an unprimeable number, because it can be changed into a prime (144411023333) 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 7 ways as a sum of consecutive naturals, for example, 1565416 + ... + 1655097.
It is an arithmetic number, because the mean of its divisors is an integer number (24070121636).
Almost surely, 2144411023433 is an apocalyptic number.
It is an amenable number.
144411023433 is a deficient number, since it is larger than the sum of its proper divisors (48149949655).
144411023433 is a wasteful number, since it uses less digits than its factorization.
144411023433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3235463.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 144411023433 its reverse (334320114441), we get a palindrome (478731137874).
The spelling of 144411023433 in words is "one hundred forty-four billion, four hundred eleven million, twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •