Search a number
-
+
36960031 is a prime number
BaseRepresentation
bin1000110011111…
…1011100011111
32120112202122001
42030333130133
533430210111
63400103131
7626104123
oct214773437
976482561
1036960031
1119954689
1210464aa7
137870c54
144ca1583
1533a11c1
hex233f71f

36960031 has 2 divisors, whose sum is σ = 36960032. Its totient is φ = 36960030.

The previous prime is 36960013. The next prime is 36960043. The reversal of 36960031 is 13006963.

Together with previous prime (36960013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 36960031 - 25 = 36959999 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 236960031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2916, while the sum is 28.

The square root of 36960031 is about 6079.4762109905. The cubic root of 36960031 is about 333.1021549289.

Adding to 36960031 its reverse (13006963), we get a palindrome (49966994).

The spelling of 36960031 in words is "thirty-six million, nine hundred sixty thousand, thirty-one".