Base | Representation |
---|---|
bin | 11010011000000… |
… | …011011110010001 |
3 | 1010211200000010101 |
4 | 122120003132101 |
5 | 1401240411142 |
6 | 111524332401 |
7 | 13652205142 |
oct | 3230033621 |
9 | 1124600111 |
10 | 442513297 |
11 | 207872876 |
12 | 104244101 |
13 | 708a80b5 |
14 | 42aadac9 |
15 | 28cb00b7 |
hex | 1a603791 |
442513297 has 8 divisors (see below), whose sum is σ = 445041000. Its totient is φ = 439993344.
The previous prime is 442513289. The next prime is 442513327. The reversal of 442513297 is 792315244.
It is a Cunningham number, because it is equal to 210362+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1 + 442513296 = 1^2 + 21036^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 442513297 - 23 = 442513289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (442513397) 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 in 7 ways as a sum of consecutive naturals, for example, 140779 + ... + 143887.
It is an arithmetic number, because the mean of its divisors is an integer number (55630125).
Almost surely, 2442513297 is an apocalyptic number.
It is an amenable number.
442513297 is a deficient number, since it is larger than the sum of its proper divisors (2527703).
442513297 is a wasteful number, since it uses less digits than its factorization.
442513297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3875.
The product of its digits is 60480, while the sum is 37.
The square root of 442513297 is about 21036.0000237688. Note that the first 4 decimals coincide. The cubic root of 442513297 is about 762.0359176195.
The spelling of 442513297 in words is "four hundred forty-two million, five hundred thirteen thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •