Base | Representation |
---|---|
bin | 1001100110011… |
… | …1000100100001 |
3 | 2210202211101211 |
4 | 2121213010201 |
5 | 40302034230 |
6 | 3555030121 |
7 | 666162415 |
oct | 231470441 |
9 | 83684354 |
10 | 40268065 |
11 | 20803aa2 |
12 | 1159b341 |
13 | 845b876 |
14 | 54c2d45 |
15 | 380642a |
hex | 2667121 |
40268065 has 4 divisors (see below), whose sum is σ = 48321684. Its totient is φ = 32214448.
The previous prime is 40268057. The next prime is 40268069. The reversal of 40268065 is 56086204.
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 6115729 + 34152336 = 2473^2 + 5844^2 .
It is a cyclic number.
It is not a de Polignac number, because 40268065 - 23 = 40268057 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 not an unprimeable number, because it can be changed into a prime (40268069) by changing a digit.
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, 4026802 + ... + 4026811.
It is an arithmetic number, because the mean of its divisors is an integer number (12080421).
Almost surely, 240268065 is an apocalyptic number.
It is an amenable number.
40268065 is a deficient number, since it is larger than the sum of its proper divisors (8053619).
40268065 is an equidigital number, since it uses as much as digits as its factorization.
40268065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8053618.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 40268065 is about 6345.7123319608. The cubic root of 40268065 is about 342.7574635411.
The spelling of 40268065 in words is "forty million, two hundred sixty-eight thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •