Search a number
-
+
4040560037 is a prime number
BaseRepresentation
bin1111000011010110…
…0000110110100101
3101102121000201100202
43300311200312211
531233340410122
61504535120245
7202062123263
oct36065406645
911377021322
104040560037
111793877618
12949213085
134c5153137
142a48b1433
15189ad7e92
hexf0d60da5

4040560037 has 2 divisors, whose sum is σ = 4040560038. Its totient is φ = 4040560036.

The previous prime is 4040560033. The next prime is 4040560049. The reversal of 4040560037 is 7300650404.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3590526241 + 450033796 = 59921^2 + 21214^2 .

It is a cyclic number.

It is not a de Polignac number, because 4040560037 - 22 = 4040560033 is a prime.

It is a super-2 number, since 2×40405600372 = 32652250825202882738, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 4040559991 and 4040560009.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (4040560031) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2020280018 + 2020280019.

It is an arithmetic number, because the mean of its divisors is an integer number (2020280019).

Almost surely, 24040560037 is an apocalyptic number.

It is an amenable number.

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

4040560037 is an equidigital number, since it uses as much as digits as its factorization.

4040560037 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 10080, while the sum is 29.

The square root of 4040560037 is about 63565.3996841049. The cubic root of 4040560037 is about 1592.7484387565.

The spelling of 4040560037 in words is "four billion, forty million, five hundred sixty thousand, thirty-seven".