Search a number
-
+
155013321 = 3223231709
BaseRepresentation
bin10010011110101…
…01000011001001
3101210200111022010
421033111003021
5304140411241
623214250133
73561406611
oct1117250311
9353614263
10155013321
117a556891
1243ab6949
1326165a78
1416831a41
15d91ed16
hex93d50c9

155013321 has 8 divisors (see below), whose sum is σ = 207612160. Its totient is φ = 102878352.

The previous prime is 155013301. The next prime is 155013329. The reversal of 155013321 is 123310551.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 155013321 - 25 = 155013289 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115186 + ... + 116523.

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

Almost surely, 2155013321 is an apocalyptic number.

It is an amenable number.

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

155013321 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 231935.

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 155013321 is about 12450.4345707288. The cubic root of 155013321 is about 537.1839234882.

Adding to 155013321 its reverse (123310551), we get a palindrome (278323872).

The spelling of 155013321 in words is "one hundred fifty-five million, thirteen thousand, three hundred twenty-one".

Divisors: 1 3 223 669 231709 695127 51671107 155013321