Search a number
BaseRepresentation
bin100100110110000111
321200000121
4210312013
514312134
63122411
71165666
oct446607
9250017
10150919
11a342a
1273407
1353902
143cddd
152eab4
hex24d87

150919 has 2 divisors, whose sum is σ = 150920. Its totient is φ = 150918.

The previous prime is 150907. The next prime is 150929. The reversal of 150919 is 919051.

150919 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 150919 - 27 = 150791 is a prime.

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

It is a plaindrome in base 14.

It is a junction number, because it is equal to n+sod(n) for n = 150893 and 150902.

It is a congruent number.

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

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

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

2150919 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 405, while the sum is 25.

The square root of 150919 is about 388.4829468587. The cubic root of 150919 is about 53.2412168576.

The spelling of 150919 in words is "one hundred fifty thousand, nine hundred nineteen".