Search a number
-
+
39050002 = 219525001
BaseRepresentation
bin1001010011110…
…1101100010010
32201110221112101
42110331230102
534444100002
63512551014
7652630255
oct224755422
981427471
1039050002
1120051932
12110b246a
138123314
14528709c
153665587
hex253db12

39050002 has 4 divisors (see below), whose sum is σ = 58575006. Its totient is φ = 19525000.

The previous prime is 39049993. The next prime is 39050009. The reversal of 39050002 is 20005093.

39050002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a Cunningham number, because it is equal to 62492+1.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 39050001 + 1 = 6249^2 + 1^2 .

It is not an unprimeable number, because it can be changed into a prime (39050009) 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, 9762499 + ... + 9762502.

Almost surely, 239050002 is an apocalyptic number.

39050002 is a deficient number, since it is larger than the sum of its proper divisors (19525004).

39050002 is a wasteful number, since it uses less digits than its factorization.

39050002 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 19525003.

The product of its (nonzero) digits is 270, while the sum is 19.

The square root of 39050002 is about 6249.0000800128. Note that the first 4 decimals coincide. The cubic root of 39050002 is about 339.2660117703.

Adding to 39050002 its reverse (20005093), we get a palindrome (59055095).

The spelling of 39050002 in words is "thirty-nine million, fifty thousand, two".

Divisors: 1 2 19525001 39050002