Base | Representation |
---|---|
bin | 11010001111000… |
… | …001001000010001 |
3 | 1010200012122121111 |
4 | 122033001020101 |
5 | 1400134110101 |
6 | 111401453321 |
7 | 13623110554 |
oct | 3217011021 |
9 | 1120178544 |
10 | 440144401 |
11 | 2064a5004 |
12 | 1034a1241 |
13 | 70258a98 |
14 | 4265469b |
15 | 28993251 |
hex | 1a3c1211 |
440144401 has 2 divisors, whose sum is σ = 440144402. Its totient is φ = 440144400.
The previous prime is 440144381. The next prime is 440144423. The reversal of 440144401 is 104441044.
It is a happy number.
It is an a-pointer prime, because the next prime (440144423) can be obtained adding 440144401 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 429484176 + 10660225 = 20724^2 + 3265^2 .
It is a cyclic number.
It is not a de Polignac number, because 440144401 - 27 = 440144273 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (440144461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220072200 + 220072201.
It is an arithmetic number, because the mean of its divisors is an integer number (220072201).
Almost surely, 2440144401 is an apocalyptic number.
It is an amenable number.
440144401 is a deficient number, since it is larger than the sum of its proper divisors (1).
440144401 is an equidigital number, since it uses as much as digits as its factorization.
440144401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 22.
The square root of 440144401 is about 20979.6187048287. The cubic root of 440144401 is about 760.6736876182.
Adding to 440144401 its reverse (104441044), we get a palindrome (544585445).
The spelling of 440144401 in words is "four hundred forty million, one hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •