Base | Representation |
---|---|
bin | 101011000011000… |
… | …1001000001110101 |
3 | 10201122222200110202 |
4 | 1112012021001311 |
5 | 10424234403141 |
6 | 355155330245 |
7 | 50536424501 |
oct | 12606110165 |
9 | 3648880422 |
10 | 1444450421 |
11 | 681399a87 |
12 | 3438b0985 |
13 | 1a0342bbb |
14 | d9ba3301 |
15 | 86c2549b |
hex | 56189075 |
1444450421 has 2 divisors, whose sum is σ = 1444450422. Its totient is φ = 1444450420.
The previous prime is 1444450349. The next prime is 1444450463. The reversal of 1444450421 is 1240544441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1405200196 + 39250225 = 37486^2 + 6265^2 .
It is an emirp because it is prime and its reverse (1240544441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1444450421 - 210 = 1444449397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1444450481) 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 as a sum of consecutive naturals, namely, 722225210 + 722225211.
It is an arithmetic number, because the mean of its divisors is an integer number (722225211).
Almost surely, 21444450421 is an apocalyptic number.
It is an amenable number.
1444450421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1444450421 is an equidigital number, since it uses as much as digits as its factorization.
1444450421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10240, while the sum is 29.
The square root of 1444450421 is about 38005.9261300129. The cubic root of 1444450421 is about 1130.4053733946.
Adding to 1444450421 its reverse (1240544441), we get a palindrome (2684994862).
The spelling of 1444450421 in words is "one billion, four hundred forty-four million, four hundred fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •