Search a number
-
+
1101152758020 = 2235744317093463
BaseRepresentation
bin10000000001100001110…
…100011010100100000100
310220021021020011221110020
4100001201310122210010
5121020130101224040
62201510153055140
7142361410003050
oct20014164324404
93807236157406
101101152758020
11394aa6030177
121594b19b74b0
137cab886b803
143b42061ac60
151d99bca8cd0
hex10061d1a904

1101152758020 has 192 divisors, whose sum is σ = 3534729891840. Its totient is φ = 250904489472.

The previous prime is 1101152758019. The next prime is 1101152758037. The reversal of 1101152758020 is 208572511011.

It is an unprimeable number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 317974809 + ... + 317978271.

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

Almost surely, 21101152758020 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 5600, while the sum is 33.

The spelling of 1101152758020 in words is "one trillion, one hundred one billion, one hundred fifty-two million, seven hundred fifty-eight thousand, twenty".