Search a number
-
+
158553411051 = 3721078594633
BaseRepresentation
bin1001001110101010000…
…1010000110111101011
3120011020212012211000110
42103222201100313223
510044204133123201
6200501033505403
714312046520500
oct2235241206753
9504225184013
10158553411051
11612732a3502
122688b272263
1311c4a658529
1479617554a7
1541ce9936d6
hex24ea850deb

158553411051 has 12 divisors (see below), whose sum is σ = 245919576552. Its totient is φ = 90601949088.

The previous prime is 158553411031. The next prime is 158553411073. The reversal of 158553411051 is 150114355851.

It is a happy number.

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

It is not a de Polignac number, because 158553411051 - 213 = 158553402859 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 539297170 + ... + 539297463.

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

Almost surely, 2158553411051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1078594650 (or 1078594643 counting only the distinct ones).

The product of its (nonzero) digits is 60000, while the sum is 39.

The spelling of 158553411051 in words is "one hundred fifty-eight billion, five hundred fifty-three million, four hundred eleven thousand, fifty-one".

Divisors: 1 3 7 21 49 147 1078594633 3235783899 7550162431 22650487293 52851137017 158553411051