Base | Representation |
---|---|
bin | 11010011000100… |
… | …010010010110101 |
3 | 1010211220102022002 |
4 | 122120202102311 |
5 | 1401303431131 |
6 | 111531145045 |
7 | 13653242201 |
oct | 3230422265 |
9 | 1124812262 |
10 | 442639541 |
11 | 207949703 |
12 | 1042a5185 |
13 | 709206b6 |
14 | 42b03b01 |
15 | 28cd76cb |
hex | 1a6224b5 |
442639541 has 2 divisors, whose sum is σ = 442639542. Its totient is φ = 442639540.
The previous prime is 442639537. The next prime is 442639543. The reversal of 442639541 is 145936244.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 305515441 + 137124100 = 17479^2 + 11710^2 .
It is a cyclic number.
It is not a de Polignac number, because 442639541 - 22 = 442639537 is a prime.
Together with 442639543, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 442639495 and 442639504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (442639543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 221319770 + 221319771.
It is an arithmetic number, because the mean of its divisors is an integer number (221319771).
Almost surely, 2442639541 is an apocalyptic number.
It is an amenable number.
442639541 is a deficient number, since it is larger than the sum of its proper divisors (1).
442639541 is an equidigital number, since it uses as much as digits as its factorization.
442639541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 38.
The square root of 442639541 is about 21039.0004753078. Note that the first 3 decimals coincide. The cubic root of 442639541 is about 762.1083774499.
The spelling of 442639541 in words is "four hundred forty-two million, six hundred thirty-nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •