Base | Representation |
---|---|
bin | 1010001011110… |
… | …0010111000101 |
3 | 2222101010100221 |
4 | 2202330113011 |
5 | 41413331230 |
6 | 4123304341 |
7 | 1026032155 |
oct | 242742705 |
9 | 88333327 |
10 | 42714565 |
11 | 221250a3 |
12 | 1237b0b1 |
13 | 8b072ba |
14 | 595c765 |
15 | 3b3b27a |
hex | 28bc5c5 |
42714565 has 32 divisors (see below), whose sum is σ = 57127680. Its totient is φ = 30514176.
The previous prime is 42714547. The next prime is 42714569. The reversal of 42714565 is 56541724.
42714565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 42714565 - 25 = 42714533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42714565.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42714569) 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 31 ways as a sum of consecutive naturals, for example, 246819 + ... + 246991.
It is an arithmetic number, because the mean of its divisors is an integer number (1785240).
Almost surely, 242714565 is an apocalyptic number.
It is an amenable number.
42714565 is a deficient number, since it is larger than the sum of its proper divisors (14413115).
42714565 is a wasteful number, since it uses less digits than its factorization.
42714565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333.
The product of its digits is 33600, while the sum is 34.
The square root of 42714565 is about 6535.6380713745. The cubic root of 42714565 is about 349.5628965200.
It can be divided in two parts, 4271 and 4565, that added together give a square (8836 = 942).
The spelling of 42714565 in words is "forty-two million, seven hundred fourteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •