Search a number
-
+
152002 = 276001
BaseRepresentation
bin100101000111000010
321201111201
4211013002
514331002
63131414
71202104
oct450702
9251451
10152002
11a4224
1273b6a
1354256
143d574
1530087
hex251c2

152002 has 4 divisors (see below), whose sum is σ = 228006. Its totient is φ = 76000.

The previous prime is 151969. The next prime is 152003. The reversal of 152002 is 200251.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 200251 = 434657.

It can be written as a sum of positive squares in only one way, i.e., 116281 + 35721 = 341^2 + 189^2 .

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (152003) by changing a digit.

152002 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

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, 37999 + ... + 38002.

2152002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 76003.

The product of its (nonzero) digits is 20, while the sum is 10.

The square root of 152002 is about 389.8743387298. The cubic root of 152002 is about 53.3682670437.

Adding to 152002 its reverse (200251), we get a palindrome (352253).

It can be divided in two parts, 1 and 52002, that added together give a triangular number (52003 = T322).

The spelling of 152002 in words is "one hundred fifty-two thousand, two".

Divisors: 1 2 76001 152002