Search a number
-
+
150003397 is a prime number
BaseRepresentation
bin10001111000011…
…01111011000101
3101110020221222101
420330031323011
5301400102042
622515032101
73501002455
oct1074157305
9343227871
10150003397
1177744855
124229b631
132510060b
1415cc9d65
15d2806b7
hex8f0dec5

150003397 has 2 divisors, whose sum is σ = 150003398. Its totient is φ = 150003396.

The previous prime is 150003353. The next prime is 150003433. The reversal of 150003397 is 793300051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130165281 + 19838116 = 11409^2 + 4454^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2150003397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 150003397 is about 12247.5873950750. The cubic root of 150003397 is about 531.3332955068. Note that the first 3 decimals are identical.

The spelling of 150003397 in words is "one hundred fifty million, three thousand, three hundred ninety-seven".