Search a number
-
+
151969 is a prime number
BaseRepresentation
bin100101000110100001
321201110111
4211012201
514330334
63131321
71202026
oct450641
9251414
10151969
11a41a4
1273b41
135422c
143d54d
1530064
hex251a1

151969 has 2 divisors, whose sum is σ = 151970. Its totient is φ = 151968.

The previous prime is 151967. The next prime is 152003. The reversal of 151969 is 969151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 144400 + 7569 = 380^2 + 87^2 .

It is a cyclic number.

It is not a de Polignac number, because 151969 - 21 = 151967 is a prime.

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

Together with 151967, it forms a pair of twin primes.

It is an Ulam number.

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

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

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

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

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

2151969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2430, while the sum is 31.

The square root of 151969 is about 389.8320151039. The cubic root of 151969 is about 53.3644046378.

The spelling of 151969 in words is "one hundred fifty-one thousand, nine hundred sixty-nine".