Search a number
-
+
155215010569 = 5912132168807
BaseRepresentation
bin1001000010001110001…
…0010001101100001001
3112211122012102111111011
42100203202101230021
510020340020314234
6155145500203521
714133241551463
oct2204342215411
9484565374434
10155215010569
115a90a910843
12260b92395a1
1311837b1c728
147726221133
154086857b64
hex2423891b09

155215010569 has 8 divisors (see below), whose sum is σ = 157975974720. Its totient is φ = 152458386576.

The previous prime is 155215010557. The next prime is 155215010593. The reversal of 155215010569 is 965010512551.

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

It is a cyclic number.

It is not a de Polignac number, because 155215010569 - 213 = 155215002377 is a prime.

It is a super-2 number, since 2×1552150105692 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 2155215010569 is an apocalyptic number.

It is an amenable number.

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

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

155215010569 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2170079.

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

The spelling of 155215010569 in words is "one hundred fifty-five billion, two hundred fifteen million, ten thousand, five hundred sixty-nine".

Divisors: 1 59 1213 71567 2168807 127959613 2630762891 155215010569