Search a number
-
+
36959017001 is a prime number
BaseRepresentation
bin100010011010111011…
…011101100000101001
310112101201220121001112
4202122323131200221
51101143002021001
624551224000105
72445610314104
oct423273354051
9115351817045
1036959017001
1114746446555
1271b5600035
13364004bc3a
141b0877773b
15e64a49cbb
hex89aedd829

36959017001 has 2 divisors, whose sum is σ = 36959017002. Its totient is φ = 36959017000.

The previous prime is 36959016959. The next prime is 36959017057. The reversal of 36959017001 is 10071095963.

36959017001 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., 22216200601 + 14742816400 = 149051^2 + 121420^2 .

It is an emirp because it is prime and its reverse (10071095963) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-36959017001 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 36959017001.

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

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

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

Almost surely, 236959017001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51030, while the sum is 41.

The spelling of 36959017001 in words is "thirty-six billion, nine hundred fifty-nine million, seventeen thousand, one".