Base | Representation |
---|---|
bin | 11010010110100… |
… | …100000010111001 |
3 | 1010210221010221122 |
4 | 122112210002321 |
5 | 1401140404200 |
6 | 111512115025 |
7 | 13645656443 |
oct | 3226440271 |
9 | 1123833848 |
10 | 442122425 |
11 | 207626138 |
12 | 104095a75 |
13 | 7079c204 |
14 | 42a0b493 |
15 | 28c34385 |
hex | 1a5a40b9 |
442122425 has 6 divisors (see below), whose sum is σ = 548231838. Its totient is φ = 353697920.
The previous prime is 442122391. The next prime is 442122469. The reversal of 442122425 is 524221244.
It can be written as a sum of positive squares in 3 ways, for example, as 57805609 + 384316816 = 7603^2 + 19604^2 .
It is a de Polignac number, because none of the positive numbers 2k-442122425 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 442122394 and 442122403.
It is an unprimeable number.
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 in 5 ways as a sum of consecutive naturals, for example, 8842424 + ... + 8842473.
It is an arithmetic number, because the mean of its divisors is an integer number (91371973).
Almost surely, 2442122425 is an apocalyptic number.
It is an amenable number.
442122425 is a deficient number, since it is larger than the sum of its proper divisors (106109413).
442122425 is a wasteful number, since it uses less digits than its factorization.
442122425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17684907 (or 17684902 counting only the distinct ones).
The product of its digits is 5120, while the sum is 26.
The square root of 442122425 is about 21026.7074217529. The cubic root of 442122425 is about 761.8114827474.
Adding to 442122425 its reverse (524221244), we get a palindrome (966343669).
The spelling of 442122425 in words is "four hundred forty-two million, one hundred twenty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •