Base | Representation |
---|---|
bin | 1101000111011000111… |
… | …01100111001011111001 |
3 | 1121002012010210011211212 |
4 | 12203230131213023321 |
5 | 24340404302100231 |
6 | 543004540132505 |
7 | 44362241652224 |
oct | 6435435471371 |
9 | 1532163704755 |
10 | 450643784441 |
11 | 164131739204 |
12 | 73407837135 |
13 | 33659896bb6 |
14 | 17b501d65bb |
15 | bac7a5942b |
hex | 68ec7672f9 |
450643784441 has 2 divisors, whose sum is σ = 450643784442. Its totient is φ = 450643784440.
The previous prime is 450643784413. The next prime is 450643784443. The reversal of 450643784441 is 144487346054.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 226389446416 + 224254338025 = 475804^2 + 473555^2 .
It is a cyclic number.
It is not a de Polignac number, because 450643784441 - 218 = 450643522297 is a prime.
Together with 450643784443, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 450643784441.
It is not a weakly prime, because it can be changed into another prime (450643784443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225321892220 + 225321892221.
It is an arithmetic number, because the mean of its divisors is an integer number (225321892221).
Almost surely, 2450643784441 is an apocalyptic number.
It is an amenable number.
450643784441 is a deficient number, since it is larger than the sum of its proper divisors (1).
450643784441 is an equidigital number, since it uses as much as digits as its factorization.
450643784441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5160960, while the sum is 50.
The spelling of 450643784441 in words is "four hundred fifty billion, six hundred forty-three million, seven hundred eighty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •