Base | Representation |
---|---|
bin | 11010110101110… |
… | …110101010010101 |
3 | 1011101100212221221 |
4 | 122311312222111 |
5 | 1410240401031 |
6 | 112404010341 |
7 | 14105462200 |
oct | 3265665225 |
9 | 1141325857 |
10 | 450325141 |
11 | 211218a42 |
12 | 1069909b1 |
13 | 723b19a6 |
14 | 43b44937 |
15 | 29804a11 |
hex | 1ad76a95 |
450325141 has 12 divisors (see below), whose sum is σ = 527193228. Its totient is φ = 383527872.
The previous prime is 450325133. The next prime is 450325151. The reversal of 450325141 is 141523054.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 145298916 + 305026225 = 12054^2 + 17465^2 .
It is not a de Polignac number, because 450325141 - 23 = 450325133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450325151) 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 11 ways as a sum of consecutive naturals, for example, 21576 + ... + 36961.
It is an arithmetic number, because the mean of its divisors is an integer number (43932769).
Almost surely, 2450325141 is an apocalyptic number.
It is an amenable number.
450325141 is a deficient number, since it is larger than the sum of its proper divisors (76868087).
450325141 is a wasteful number, since it uses less digits than its factorization.
450325141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58708 (or 58701 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 450325141 is about 21220.8656986467. The cubic root of 450325141 is about 766.4939498977.
Adding to 450325141 its reverse (141523054), we get a palindrome (591848195).
The spelling of 450325141 in words is "four hundred fifty million, three hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •