Base | Representation |
---|---|
bin | 1001100111100… |
… | …0011111101001 |
3 | 2210220110022002 |
4 | 2121320133221 |
5 | 40311330213 |
6 | 4000340345 |
7 | 666610451 |
oct | 231703751 |
9 | 83813262 |
10 | 40339433 |
11 | 20852682 |
12 | 116146b5 |
13 | 84851b4 |
14 | 5500d61 |
15 | 381c658 |
hex | 26787e9 |
40339433 has 4 divisors (see below), whose sum is σ = 40392660. Its totient is φ = 40286208.
The previous prime is 40339393. The next prime is 40339441. The reversal of 40339433 is 33493304.
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 32228329 + 8111104 = 5677^2 + 2848^2 .
It is a cyclic number.
It is not a de Polignac number, because 40339433 - 28 = 40339177 is a prime.
It is a super-2 number, since 2×403394332 = 3254539709522978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40339396 and 40339405.
It is not an unprimeable number, because it can be changed into a prime (40339333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25460 + ... + 26997.
It is an arithmetic number, because the mean of its divisors is an integer number (10098165).
Almost surely, 240339433 is an apocalyptic number.
It is an amenable number.
40339433 is a deficient number, since it is larger than the sum of its proper divisors (53227).
40339433 is an equidigital number, since it uses as much as digits as its factorization.
40339433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53226.
The product of its (nonzero) digits is 11664, while the sum is 29.
The square root of 40339433 is about 6351.3331671390. Note that the first 3 decimals coincide. The cubic root of 40339433 is about 342.9598362932.
The spelling of 40339433 in words is "forty million, three hundred thirty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •