Search a number
-
+
155060560507 = 1415871095161
BaseRepresentation
bin1001000001101001010…
…1000110001001111011
3112211020102210121211111
42100122111012021323
510020031000414012
6155122301541151
714126355005656
oct2203225061173
9484212717744
10155060560507
115a84070a166
12260755747b7
1311811b23168
14770d8d889d
154077ee9ba7
hex241a54627b

155060560507 has 4 divisors (see below), whose sum is σ = 155061797256. Its totient is φ = 155059323760.

The previous prime is 155060560481. The next prime is 155060560511. The reversal of 155060560507 is 705065060551.

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

It is a cyclic number.

It is not a de Polignac number, because 155060560507 - 211 = 155060558459 is a prime.

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 155060560507.

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

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

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

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

Almost surely, 2155060560507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1236748.

The product of its (nonzero) digits is 157500, while the sum is 40.

The spelling of 155060560507 in words is "one hundred fifty-five billion, sixty million, five hundred sixty thousand, five hundred seven".

Divisors: 1 141587 1095161 155060560507