Search a number
-
+
150371365363 is a prime number
BaseRepresentation
bin1000110000001011010…
…1001111000111110011
3112101010122020211101021
42030002311033013303
54430430032142423
6153025112120311
713602225342052
oct2140265170763
9471118224337
10150371365363
115885479647a
1225187096097
13112454a638b
1473c6c20399
153da14d895d
hex2302d4f1f3

150371365363 has 2 divisors, whose sum is σ = 150371365364. Its totient is φ = 150371365362.

The previous prime is 150371365349. The next prime is 150371365381. The reversal of 150371365363 is 363563173051.

150371365363 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 is a cyclic number.

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

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

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

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

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

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

Almost surely, 2150371365363 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 510300, while the sum is 43.

The spelling of 150371365363 in words is "one hundred fifty billion, three hundred seventy-one million, three hundred sixty-five thousand, three hundred sixty-three".