Base | Representation |
---|---|
bin | 101011001010001… |
… | …0000010110101001 |
3 | 10201220221122221112 |
4 | 1112110100112221 |
5 | 10431211303231 |
6 | 355410520105 |
7 | 50613034643 |
oct | 12624202651 |
9 | 3656848845 |
10 | 1448150441 |
11 | 683496951 |
12 | 344b96035 |
13 | 1a103a06a |
14 | da487893 |
15 | 8720692b |
hex | 565105a9 |
1448150441 has 2 divisors, whose sum is σ = 1448150442. Its totient is φ = 1448150440.
The previous prime is 1448150419. The next prime is 1448150477. The reversal of 1448150441 is 1440518441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1377523225 + 70627216 = 37115^2 + 8404^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1448150441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1448150398 and 1448150407.
It is not a weakly prime, because it can be changed into another prime (1448150941) 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, 724075220 + 724075221.
It is an arithmetic number, because the mean of its divisors is an integer number (724075221).
Almost surely, 21448150441 is an apocalyptic number.
It is an amenable number.
1448150441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1448150441 is an equidigital number, since it uses as much as digits as its factorization.
1448150441 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 32.
The square root of 1448150441 is about 38054.5718803930. The cubic root of 1448150441 is about 1131.3697439417.
Adding to 1448150441 its reverse (1440518441), we get a palindrome (2888668882).
The spelling of 1448150441 in words is "one billion, four hundred forty-eight million, one hundred fifty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •