Base | Representation |
---|---|
bin | 11010110101100… |
… | …000111011101101 |
3 | 1011101012100212122 |
4 | 122311200323231 |
5 | 1410230024031 |
6 | 112402042325 |
7 | 14104641545 |
oct | 3265407355 |
9 | 1141170778 |
10 | 450236141 |
11 | 211168093 |
12 | 1069493a5 |
13 | 72380324 |
14 | 43b20325 |
15 | 297d847b |
hex | 1ad60eed |
450236141 has 8 divisors (see below), whose sum is σ = 474525120. Its totient is φ = 426006432.
The previous prime is 450236119. The next prime is 450236147. The reversal of 450236141 is 141632054.
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 450236141 - 210 = 450235117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 450236141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450236147) 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 7 ways as a sum of consecutive naturals, for example, 1241 + ... + 30033.
It is an arithmetic number, because the mean of its divisors is an integer number (59315640).
Almost surely, 2450236141 is an apocalyptic number.
It is an amenable number.
450236141 is a deficient number, since it is larger than the sum of its proper divisors (24288979).
450236141 is a wasteful number, since it uses less digits than its factorization.
450236141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29635.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 450236141 is about 21218.7686023483. The cubic root of 450236141 is about 766.4434512321.
Adding to 450236141 its reverse (141632054), we get a palindrome (591868195).
The spelling of 450236141 in words is "four hundred fifty million, two hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •