Base | Representation |
---|---|
bin | 1001011100010… |
… | …1001110010101 |
3 | 2202112011001002 |
4 | 2113011032111 |
5 | 40114331031 |
6 | 3532513045 |
7 | 660431612 |
oct | 227051625 |
9 | 82464032 |
10 | 39605141 |
11 | 203a0a24 |
12 | 1131b785 |
13 | 8288bc4 |
14 | 538d509 |
15 | 3724ccb |
hex | 25c5395 |
39605141 has 2 divisors, whose sum is σ = 39605142. Its totient is φ = 39605140.
The previous prime is 39605129. The next prime is 39605147. The reversal of 39605141 is 14150693.
39605141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35153041 + 4452100 = 5929^2 + 2110^2 .
It is an emirp because it is prime and its reverse (14150693) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-39605141 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39605147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19802570 + 19802571.
It is an arithmetic number, because the mean of its divisors is an integer number (19802571).
Almost surely, 239605141 is an apocalyptic number.
It is an amenable number.
39605141 is a deficient number, since it is larger than the sum of its proper divisors (1).
39605141 is an equidigital number, since it uses as much as digits as its factorization.
39605141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 39605141 is about 6293.2615550285. The cubic root of 39605141 is about 340.8661336763.
The spelling of 39605141 in words is "thirty-nine million, six hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •