Base | Representation |
---|---|
bin | 1001100000111… |
… | …0111100001101 |
3 | 2210002111020012 |
4 | 2120032330031 |
5 | 40204011320 |
6 | 3543203005 |
7 | 663130121 |
oct | 230167415 |
9 | 83074205 |
10 | 39907085 |
11 | 20587869 |
12 | 11446465 |
13 | 836347a |
14 | 542b581 |
15 | 37844c5 |
hex | 260ef0d |
39907085 has 4 divisors (see below), whose sum is σ = 47888508. Its totient is φ = 31925664.
The previous prime is 39907081. The next prime is 39907151. The reversal of 39907085 is 58070993.
39907085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4313929 + 35593156 = 2077^2 + 5966^2 .
It is a cyclic number.
It is not a de Polignac number, because 39907085 - 22 = 39907081 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39907081) 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 in 3 ways as a sum of consecutive naturals, for example, 3990704 + ... + 3990713.
It is an arithmetic number, because the mean of its divisors is an integer number (11972127).
Almost surely, 239907085 is an apocalyptic number.
It is an amenable number.
39907085 is a deficient number, since it is larger than the sum of its proper divisors (7981423).
39907085 is an equidigital number, since it uses as much as digits as its factorization.
39907085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7981422.
The product of its (nonzero) digits is 68040, while the sum is 41.
The square root of 39907085 is about 6317.2054739418. The cubic root of 39907085 is about 341.7301800096.
The spelling of 39907085 in words is "thirty-nine million, nine hundred seven thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •