Search a number
-
+
151451 is a prime number
BaseRepresentation
bin100100111110011011
321200202022
4210332123
514321301
63125055
71200356
oct447633
9250668
10151451
11a3873
127378b
1353c21
143d29d
152ed1b
hex24f9b

151451 has 2 divisors, whose sum is σ = 151452. Its totient is φ = 151450.

The previous prime is 151433. The next prime is 151471. The reversal of 151451 is 154151.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 151451 - 210 = 150427 is a prime.

It is a Sophie Germain prime.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 151451.

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

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

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

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

2151451 is an apocalyptic number.

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

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

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

The product of its digits is 100, while the sum is 17.

The square root of 151451 is about 389.1670592432. The cubic root of 151451 is about 53.3037031596.

The spelling of 151451 in words is "one hundred fifty-one thousand, four hundred fifty-one".