Base | Representation |
---|---|
bin | 1010001100010… |
… | …1101011110001 |
3 | 2222110001202022 |
4 | 2203011223301 |
5 | 41421042003 |
6 | 4124201225 |
7 | 1026251411 |
oct | 243055361 |
9 | 88401668 |
10 | 42752753 |
11 | 2215085a |
12 | 12399215 |
13 | 8b1b7b4 |
14 | 596c641 |
15 | 3b47738 |
hex | 28c5af1 |
42752753 has 4 divisors (see below), whose sum is σ = 42777588. Its totient is φ = 42727920.
The previous prime is 42752741. The next prime is 42752761. The reversal of 42752753 is 35725724.
42752753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7907344 + 34845409 = 2812^2 + 5903^2 .
It is a cyclic number.
It is not a de Polignac number, because 42752753 - 28 = 42752497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (42752713) 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 3 ways as a sum of consecutive naturals, for example, 9626 + ... + 13347.
It is an arithmetic number, because the mean of its divisors is an integer number (10694397).
Almost surely, 242752753 is an apocalyptic number.
It is an amenable number.
42752753 is a deficient number, since it is larger than the sum of its proper divisors (24835).
42752753 is a wasteful number, since it uses less digits than its factorization.
42752753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24834.
The product of its digits is 58800, while the sum is 35.
The square root of 42752753 is about 6538.5589390935. The cubic root of 42752753 is about 349.6670384499.
The spelling of 42752753 in words is "forty-two million, seven hundred fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •