Search a number
-
+
155369810904 = 233711231373661
BaseRepresentation
bin1001000010110011000…
…0110010101111011000
3112212000222201011121220
42100230300302233120
510021144132422104
6155213110132040
714140131413430
oct2205460625730
9485028634556
10155369810904
115a98a231600
1226141051020
1311860c0c569
14773c9d92c0
1540952347d9
hex242cc32bd8

155369810904 has 384 divisors, whose sum is σ = 505792573440. Its totient is φ = 38890368000.

The previous prime is 155369810857. The next prime is 155369810917. The reversal of 155369810904 is 409018963551.

It is a congruent number.

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 235052334 + ... + 235052994.

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

Almost surely, 2155369810904 is an apocalyptic number.

155369810904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 155369810904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252896286720).

155369810904 is an abundant number, since it is smaller than the sum of its proper divisors (350422762536).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 1166400, while the sum is 51.

The spelling of 155369810904 in words is "one hundred fifty-five billion, three hundred sixty-nine million, eight hundred ten thousand, nine hundred four".