Base | Representation |
---|---|
bin | 1010100001111110000010… |
… | …0011000011101000000000 |
3 | 1111222220122210121102011010 |
4 | 2220133200203003220000 |
5 | 3004201141230231432 |
6 | 40343103325520520 |
7 | 2303351040244221 |
oct | 250374043035000 |
9 | 44886583542133 |
10 | 11578704148992 |
11 | 37645566aa442 |
12 | 1370044713140 |
13 | 65cb37092296 |
14 | 2c05ab3b3248 |
15 | 1512c6b3a3cc |
hex | a87e08c3a00 |
11578704148992 has 80 divisors (see below), whose sum is σ = 30866032831392. Its totient is φ = 3857110487040.
The previous prime is 11578704148951. The next prime is 11578704148993. The reversal of 11578704148992 is 29984140787511.
It is not an unprimeable number, because it can be changed into a prime (11578704148993) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13878 + ... + 4812234.
Almost surely, 211578704148992 is an apocalyptic number.
11578704148992 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 11578704148992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15433016415696).
11578704148992 is an abundant number, since it is smaller than the sum of its proper divisors (19287328682400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11578704148992 is an equidigital number, since it uses as much as digits as its factorization.
11578704148992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4799949 (or 4799933 counting only the distinct ones).
The product of its (nonzero) digits is 40642560, while the sum is 66.
The spelling of 11578704148992 in words is "eleven trillion, five hundred seventy-eight billion, seven hundred four million, one hundred forty-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •