Search a number
-
+
11110091715072 = 29347371034339
BaseRepresentation
bin1010000110101100010100…
…0100011111001000000000
31110100010002101122021010000
42201223011010133020000
52424011431434340242
635343523343040000
72224451300261550
oct241530504371000
943303071567100
1011110091715072
1135a38441519a9
1212b52632a0000
136278a592371c
142a5a349d1160
15143eeb86ba4c
hexa1ac511f200

11110091715072 has 400 divisors, whose sum is σ = 38922247298880. Its totient is φ = 3088516718592.

The previous prime is 11110091715067. The next prime is 11110091715113. The reversal of 11110091715072 is 27051719001111.

It is a super-2 number, since 2×111100917150722 (a number of 27 digits) contains 22 as substring.

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 39 ways as a sum of consecutive naturals, for example, 10224079 + ... + 11258417.

Almost surely, 211110091715072 is an apocalyptic number.

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

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

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

11110091715072 is an equidigital number, since it uses as much as digits as its factorization.

11110091715072 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 11110091715072 in words is "eleven trillion, one hundred ten billion, ninety-one million, seven hundred fifteen thousand, seventy-two".