Base | Representation |
---|---|
bin | 1001110000000… |
… | …0100110101110 |
3 | 2211221210001120 |
4 | 2130000212232 |
5 | 40432200232 |
6 | 4020321410 |
7 | 1004422032 |
oct | 234004656 |
9 | 84853046 |
10 | 40896942 |
11 | 210a3529 |
12 | 11843266 |
13 | 861bb98 |
14 | 56081c2 |
15 | 38cc92c |
hex | 27009ae |
40896942 has 8 divisors (see below), whose sum is σ = 81793896. Its totient is φ = 13632312.
The previous prime is 40896941. The next prime is 40896943. The reversal of 40896942 is 24969804.
It is an interprime number because it is at equal distance from previous prime (40896941) and next prime (40896943).
It is a sphenic number, since it is the product of 3 distinct primes.
40896942 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 40896894 and 40896903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40896941) 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, 3408073 + ... + 3408084.
It is an arithmetic number, because the mean of its divisors is an integer number (10224237).
Almost surely, 240896942 is an apocalyptic number.
40896942 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40896942 is a wasteful number, since it uses less digits than its factorization.
40896942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6816162.
The product of its (nonzero) digits is 124416, while the sum is 42.
The square root of 40896942 is about 6395.0716962361. The cubic root of 40896942 is about 344.5325658760.
The spelling of 40896942 in words is "forty million, eight hundred ninety-six thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •