Base | Representation |
---|---|
bin | 11010110101011… |
… | …101000110010001 |
3 | 1011101011120022212 |
4 | 122311131012101 |
5 | 1410224023213 |
6 | 112401441505 |
7 | 14104545005 |
oct | 3265350621 |
9 | 1141146285 |
10 | 450220433 |
11 | 211157303 |
12 | 106940295 |
13 | 72376130 |
14 | 43b18705 |
15 | 297d39a8 |
hex | 1ad5d191 |
450220433 has 4 divisors (see below), whose sum is σ = 484852788. Its totient is φ = 415588080.
The previous prime is 450220427. The next prime is 450220483. The reversal of 450220433 is 334022054.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 94633984 + 355586449 = 9728^2 + 18857^2 .
It is a cyclic number.
It is not a de Polignac number, because 450220433 - 24 = 450220417 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 450220399 and 450220408.
It is not an unprimeable number, because it can be changed into a prime (450220483) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17316158 + ... + 17316183.
It is an arithmetic number, because the mean of its divisors is an integer number (121213197).
Almost surely, 2450220433 is an apocalyptic number.
It is an amenable number.
450220433 is a deficient number, since it is larger than the sum of its proper divisors (34632355).
450220433 is a wasteful number, since it uses less digits than its factorization.
450220433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34632354.
The product of its (nonzero) digits is 2880, while the sum is 23.
The square root of 450220433 is about 21218.3984551144. The cubic root of 450220433 is about 766.4345378104.
Adding to 450220433 its reverse (334022054), we get a palindrome (784242487).
The spelling of 450220433 in words is "four hundred fifty million, two hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •