Base | Representation |
---|---|
bin | 1010000110011000010101… |
… | …0001100101010000110000 |
3 | 1110022121020110220222220221 |
4 | 2201212011101211100300 |
5 | 2423414434432021320 |
6 | 35341235122342424 |
7 | 2224201321214260 |
oct | 241460521452060 |
9 | 43277213828827 |
10 | 11104726438960 |
11 | 35a1540636610 |
12 | 12b42064baa14 |
13 | 62722c1c072b |
14 | 2a56862077a0 |
15 | 143cd58103aa |
hex | a1985465430 |
11104726438960 has 160 divisors (see below), whose sum is σ = 32248794230784. Its totient is φ = 3454814592000.
The previous prime is 11104726438951. The next prime is 11104726438973. The reversal of 11104726438960 is 6983462740111.
It is a junction number, because it is equal to n+sod(n) for n = 11104726438898 and 11104726438907.
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, 1666465 + ... + 4998655.
Almost surely, 211104726438960 is an apocalyptic number.
11104726438960 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 11104726438960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16124397115392).
11104726438960 is an abundant number, since it is smaller than the sum of its proper divisors (21144067791824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11104726438960 is a wasteful number, since it uses less digits than its factorization.
11104726438960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3332763 (or 3332757 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 52.
The spelling of 11104726438960 in words is "eleven trillion, one hundred four billion, seven hundred twenty-six million, four hundred thirty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •