Search a number
-
+
152013 = 350671
BaseRepresentation
bin100101000111001101
321201112010
4211013031
514331023
63131433
71202121
oct450715
9251463
10152013
11a4234
1273b79
1354264
143d581
1530093
hex251cd

152013 has 4 divisors (see below), whose sum is σ = 202688. Its totient is φ = 101340.

The previous prime is 152003. The next prime is 152017. The reversal of 152013 is 310251.

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

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 152013 - 210 = 150989 is a prime.

It is an Ulam number.

It is a D-number.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25333 + ... + 25338.

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

2152013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 50674.

The product of its (nonzero) digits is 30, while the sum is 12.

The square root of 152013 is about 389.8884455841. Note that the first 3 decimals coincide. The cubic root of 152013 is about 53.3695543881.

Adding to 152013 its reverse (310251), we get a palindrome (462264).

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

Divisors: 1 3 50671 152013