Base | Representation |
---|---|
bin | 10001001110000… |
… | …00101111110001 |
3 | 101001210112110122 |
4 | 20213000233301 |
5 | 243434210101 |
6 | 22155540025 |
7 | 3402520463 |
oct | 1047005761 |
9 | 331715418 |
10 | 144444401 |
11 | 74598242 |
12 | 4045a615 |
13 | 23c0527a |
14 | 15280133 |
15 | ca3351b |
hex | 89c0bf1 |
144444401 has 8 divisors (see below), whose sum is σ = 147056064. Its totient is φ = 141840720.
The previous prime is 144444383. The next prime is 144444431. The reversal of 144444401 is 104444441.
144444401 = T214 + T215 + ... + T956.
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 144444401 - 226 = 77335537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144444431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43730 + ... + 46916.
It is an arithmetic number, because the mean of its divisors is an integer number (18382008).
Almost surely, 2144444401 is an apocalyptic number.
It is an amenable number.
144444401 is a deficient number, since it is larger than the sum of its proper divisors (2611663).
144444401 is an equidigital number, since it uses as much as digits as its factorization.
144444401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3991.
The product of its (nonzero) digits is 4096, while the sum is 26.
The square root of 144444401 is about 12018.5024441484. The cubic root of 144444401 is about 524.6869196072.
Adding to 144444401 its reverse (104444441), we get a palindrome (248888842).
It can be divided in two parts, 14444440 and 1, that added together give a palindrome (14444441).
The spelling of 144444401 in words is "one hundred forty-four million, four hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •