Base | Representation |
---|---|
bin | 11010010111000… |
… | …110110111011100 |
3 | 1010211012101121010 |
4 | 122113012313130 |
5 | 1401204440202 |
6 | 111515135220 |
7 | 13650122325 |
oct | 3227066734 |
9 | 1124171533 |
10 | 442265052 |
11 | 207713309 |
12 | 104144510 |
13 | 7081c0c8 |
14 | 42a4744c |
15 | 28c6176c |
hex | 1a5c6ddc |
442265052 has 48 divisors (see below), whose sum is σ = 1090454400. Its totient is φ = 139124160.
The previous prime is 442265029. The next prime is 442265059. The reversal of 442265052 is 250562244.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (442265059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57727 + ... + 64937.
It is an arithmetic number, because the mean of its divisors is an integer number (22717800).
Almost surely, 2442265052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 442265052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (545227200).
442265052 is an abundant number, since it is smaller than the sum of its proper divisors (648189348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
442265052 is a wasteful number, since it uses less digits than its factorization.
442265052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7506 (or 7504 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The square root of 442265052 is about 21030.0987158881. The cubic root of 442265052 is about 761.8933930950.
The spelling of 442265052 in words is "four hundred forty-two million, two hundred sixty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •