Base | Representation |
---|---|
bin | 1001101010010… |
… | …1010000001101 |
3 | 2211020202210011 |
4 | 2122211100031 |
5 | 40333212030 |
6 | 4004313221 |
7 | 1001303113 |
oct | 232452015 |
9 | 84222704 |
10 | 40522765 |
11 | 20968398 |
12 | 116a2811 |
13 | 851a78a |
14 | 554bab3 |
15 | 3856b2a |
hex | 26a540d |
40522765 has 4 divisors (see below), whose sum is σ = 48627324. Its totient is φ = 32418208.
The previous prime is 40522723. The next prime is 40522787. The reversal of 40522765 is 56722504.
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 30669444 + 9853321 = 5538^2 + 3139^2 .
It is a cyclic number.
It is not a de Polignac number, because 40522765 - 211 = 40520717 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4052272 + ... + 4052281.
It is an arithmetic number, because the mean of its divisors is an integer number (12156831).
Almost surely, 240522765 is an apocalyptic number.
It is an amenable number.
40522765 is a deficient number, since it is larger than the sum of its proper divisors (8104559).
40522765 is an equidigital number, since it uses as much as digits as its factorization.
40522765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8104558.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 40522765 is about 6365.7493667282. The cubic root of 40522765 is about 343.4786049601.
The spelling of 40522765 in words is "forty million, five hundred twenty-two thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •