Search a number
-
+
119208241152 = 21132721113271
BaseRepresentation
bin110111100000101011…
…1010110100000000000
3102101200211100002112200
41233001113112200000
53423114302204102
6130432530153200
711420043221400
oct1570127264000
9371624302480
10119208241152
1146612a42a70
121b12a722800
13b31a15b600
145aac124800
15317a70a51c
hex1bc15d6800

119208241152 has 1296 divisors, whose sum is σ = 479774262240. Its totient is φ = 28178841600.

The previous prime is 119208241129. The next prime is 119208241171. The reversal of 119208241152 is 251142802911.

119208241152 is a `hidden beast` number, since 1 + 192 + 0 + 8 + 2 + 411 + 52 = 666.

It is a Harshad number since it is a multiple of its sum of digits (36).

It is an unprimeable number.

It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 1678989277 + ... + 1678989347.

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

Almost surely, 2119208241152 is an apocalyptic number.

119208241152 is a gapful number since it is divisible by the number (12) 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 119208241152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (239887131120).

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

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

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

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

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

The product of its (nonzero) digits is 11520, while the sum is 36.

The spelling of 119208241152 in words is "one hundred nineteen billion, two hundred eight million, two hundred forty-one thousand, one hundred fifty-two".