Base | Representation |
---|---|
bin | 1001100110000… |
… | …0110011000101 |
3 | 2210201112011021 |
4 | 2121200303011 |
5 | 40300223443 |
6 | 3554311141 |
7 | 666024463 |
oct | 231406305 |
9 | 83645137 |
10 | 40242373 |
11 | 20796766 |
12 | 115884b1 |
13 | 844cc72 |
14 | 54b7833 |
15 | 37ed9ed |
hex | 2660cc5 |
40242373 has 4 divisors (see below), whose sum is σ = 40257088. Its totient is φ = 40227660.
The previous prime is 40242337. The next prime is 40242403. The reversal of 40242373 is 37324204.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40242373 is a prime.
It is a super-2 number, since 2×402423732 = 3238897169342258, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40242313) 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, 1911 + ... + 9172.
It is an arithmetic number, because the mean of its divisors is an integer number (10064272).
Almost surely, 240242373 is an apocalyptic number.
It is an amenable number.
40242373 is a deficient number, since it is larger than the sum of its proper divisors (14715).
40242373 is a wasteful number, since it uses less digits than its factorization.
40242373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14714.
The product of its (nonzero) digits is 4032, while the sum is 25.
The square root of 40242373 is about 6343.6876499399. The cubic root of 40242373 is about 342.6845521802.
Adding to 40242373 its reverse (37324204), we get a palindrome (77566577).
The spelling of 40242373 in words is "forty million, two hundred forty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •