Search a number
-
+
36827951131 is a prime number
BaseRepresentation
bin100010010011000111…
…011111000000011011
310112001121021202111001
4202103013133000123
51100410423414011
624530222445431
72442426263626
oct422307370033
9115047252431
1036827951131
1114689466854
127179733877
13361bb4c27a
141ad51badbd
15e582aa7c1
hex8931df01b

36827951131 has 2 divisors, whose sum is σ = 36827951132. Its totient is φ = 36827951130.

The previous prime is 36827951129. The next prime is 36827951177. The reversal of 36827951131 is 13115972863.

It is a happy number.

It is an a-pointer prime, because the next prime (36827951177) can be obtained adding 36827951131 to its sum of digits (46).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 36827951131 - 21 = 36827951129 is a prime.

It is a super-2 number, since 2×368279511312 (a number of 22 digits) contains 22 as substring.

Together with 36827951129, it forms a pair of twin primes.

It is not a weakly prime, because it can be changed into another prime (36827951101) 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, 18413975565 + 18413975566.

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

Almost surely, 236827951131 is an apocalyptic number.

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

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

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

The product of its digits is 272160, while the sum is 46.

The spelling of 36827951131 in words is "thirty-six billion, eight hundred twenty-seven million, nine hundred fifty-one thousand, one hundred thirty-one".