Search a number
-
+
59115001 = 1117973259
BaseRepresentation
bin1110000110000…
…0010111111001
311010020100112111
43201200113321
5110113140001
65511012321
71315316641
oct341402771
9133210474
1059115001
1130406a80
121796a0a1
13c32a1ba
147bcb521
1552ca851
hex38605f9

59115001 has 16 divisors (see below), whose sum is σ = 69007680. Its totient is φ = 50042880.

The previous prime is 59114987. The next prime is 59115029. The reversal of 59115001 is 10051195.

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

It is a cyclic number.

It is not a de Polignac number, because 59115001 - 25 = 59114969 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (59115031) 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 15 ways as a sum of consecutive naturals, for example, 16510 + ... + 19768.

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

Almost surely, 259115001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3384.

The product of its (nonzero) digits is 225, while the sum is 22.

The square root of 59115001 is about 7688.6280310599. The cubic root of 59115001 is about 389.5524144208.

Adding to 59115001 its reverse (10051195), we get a palindrome (69166196).

The spelling of 59115001 in words is "fifty-nine million, one hundred fifteen thousand, one".

Divisors: 1 11 17 97 187 1067 1649 3259 18139 35849 55403 316123 609433 3477353 5374091 59115001