Base | Representation |
---|---|
bin | 11010111000000… |
… | …110000000011001 |
3 | 1011102110201100212 |
4 | 122320012000121 |
5 | 1410413143111 |
6 | 112424340505 |
7 | 14113456031 |
oct | 3270060031 |
9 | 1142421325 |
10 | 450912281 |
11 | 21158a086 |
12 | 107014735 |
13 | 72559001 |
14 | 43c588c1 |
15 | 298bd98b |
hex | 1ae06019 |
450912281 has 2 divisors, whose sum is σ = 450912282. Its totient is φ = 450912280.
The previous prime is 450912251. The next prime is 450912283. The reversal of 450912281 is 182219054.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 411724681 + 39187600 = 20291^2 + 6260^2 .
It is a cyclic number.
It is not a de Polignac number, because 450912281 - 222 = 446717977 is a prime.
It is a super-2 number, since 2×4509122812 = 406643770313245922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 450912283, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (450912283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225456140 + 225456141.
It is an arithmetic number, because the mean of its divisors is an integer number (225456141).
Almost surely, 2450912281 is an apocalyptic number.
It is an amenable number.
450912281 is a deficient number, since it is larger than the sum of its proper divisors (1).
450912281 is an equidigital number, since it uses as much as digits as its factorization.
450912281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 450912281 is about 21234.6952179682. The cubic root of 450912281 is about 766.8269269471.
The spelling of 450912281 in words is "four hundred fifty million, nine hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •