Search a number
-
+
366152131 is a prime number
BaseRepresentation
bin10101110100110…
…000100111000011
3221111222110022001
4111310300213003
51222213332011
6100155524431
712034145632
oct2564604703
9844873261
10366152131
11178757574
12a2759717
135ab20087
14368b3519
15222297c1
hex15d309c3

366152131 has 2 divisors, whose sum is σ = 366152132. Its totient is φ = 366152130.

The previous prime is 366152113. The next prime is 366152147. The reversal of 366152131 is 131251663.

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

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 366152131 - 215 = 366119363 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2366152131 is an apocalyptic number.

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

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

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

The product of its digits is 3240, while the sum is 28.

The square root of 366152131 is about 19135.1020640079. The cubic root of 366152131 is about 715.4081038583.

The spelling of 366152131 in words is "three hundred sixty-six million, one hundred fifty-two thousand, one hundred thirty-one".