Base | Representation |
---|---|
bin | 1010001101000… |
… | …1001110111001 |
3 | 2222112110122022 |
4 | 2203101032321 |
5 | 41424100212 |
6 | 4125204225 |
7 | 1026536336 |
oct | 243211671 |
9 | 88473568 |
10 | 42800057 |
11 | 22183353 |
12 | 12400675 |
13 | 8b371a1 |
14 | 598198d |
15 | 3b56772 |
hex | 28d13b9 |
42800057 has 6 divisors (see below), whose sum is σ = 44226234. Its totient is φ = 41418480.
The previous prime is 42800053. The next prime is 42800059. The reversal of 42800057 is 75000824.
42800057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 42784681 + 15376 = 6541^2 + 124^2 .
It is not a de Polignac number, because 42800057 - 22 = 42800053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42799999 and 42800035.
It is not an unprimeable number, because it can be changed into a prime (42800053) 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 5 ways as a sum of consecutive naturals, for example, 21308 + ... + 23229.
It is an arithmetic number, because the mean of its divisors is an integer number (7371039).
Almost surely, 242800057 is an apocalyptic number.
It is an amenable number.
42800057 is a deficient number, since it is larger than the sum of its proper divisors (1426177).
42800057 is an equidigital number, since it uses as much as digits as its factorization.
42800057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44599 (or 44568 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 26.
The square root of 42800057 is about 6542.1752498691. The cubic root of 42800057 is about 349.7959545366.
The spelling of 42800057 in words is "forty-two million, eight hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •