Search a number
-
+
119063991552 = 28311472271321
BaseRepresentation
bin110111011100011000…
…1000101010100000000
3102101022202220110021220
41232320301011110000
53422320340212202
6130410334315040
711413342141542
oct1567061052400
9371282813256
10119063991552
1146549579120
121b0aa358a80
13b2c62c3c0c
145a96cd5692
15316cc14abc
hex1bb8c45500

119063991552 has 288 divisors, whose sum is σ = 354870319104. Its totient is φ = 35130163200.

The previous prime is 119063991539. The next prime is 119063991577. The reversal of 119063991552 is 255199360911.

It is a junction number, because it is equal to n+sod(n) for n = 119063991495 and 119063991504.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90131052 + ... + 90132372.

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

Almost surely, 2119063991552 is an apocalyptic number.

119063991552 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 119063991552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177435159552).

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

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

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

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

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

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

The spelling of 119063991552 in words is "one hundred nineteen billion, sixty-three million, nine hundred ninety-one thousand, five hundred fifty-two".