Base | Representation |
---|---|
bin | 1100110111101101011… |
… | …10101101100001110001 |
3 | 1120021110111102201200122 |
4 | 12123312232231201301 |
5 | 24221134340320213 |
6 | 535053400100025 |
7 | 43643526603131 |
oct | 6336656554161 |
9 | 1507414381618 |
10 | 442226104433 |
11 | 16060211a673 |
12 | 71858764615 |
13 | 32917962059 |
14 | 17592284ac1 |
15 | b783a56d08 |
hex | 66f6bad871 |
442226104433 has 2 divisors, whose sum is σ = 442226104434. Its totient is φ = 442226104432.
The previous prime is 442226104379. The next prime is 442226104483. The reversal of 442226104433 is 334401622244.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 440196421729 + 2029682704 = 663473^2 + 45052^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-442226104433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 442226104393 and 442226104402.
It is not a weakly prime, because it can be changed into another prime (442226104483) 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, 221113052216 + 221113052217.
It is an arithmetic number, because the mean of its divisors is an integer number (221113052217).
Almost surely, 2442226104433 is an apocalyptic number.
It is an amenable number.
442226104433 is a deficient number, since it is larger than the sum of its proper divisors (1).
442226104433 is an equidigital number, since it uses as much as digits as its factorization.
442226104433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 442226104433 its reverse (334401622244), we get a palindrome (776627726677).
The spelling of 442226104433 in words is "four hundred forty-two billion, two hundred twenty-six million, one hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •