Base | Representation |
---|---|
bin | 1010011101001110001010… |
… | …1000100011111110000000 |
3 | 1111201010010002102112011020 |
4 | 2213103202220203332000 |
5 | 3001332113000034000 |
6 | 40241413310545440 |
7 | 2264432501036640 |
oct | 247234250437600 |
9 | 44633102375136 |
10 | 11497134768000 |
11 | 37329a8935182 |
12 | 135827b208280 |
13 | 655237a8537b |
14 | 2ba670034520 |
15 | 14e1009b9ba0 |
hex | a74e2a23f80 |
11497134768000 has 768 divisors, whose sum is σ = 44097707197440. Its totient is φ = 2595732172800.
The previous prime is 11497134767981. The next prime is 11497134768071. The reversal of 11497134768000 is 86743179411.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2314701517 + ... + 2314706483.
It is an arithmetic number, because the mean of its divisors is an integer number (57418889580).
Almost surely, 211497134768000 is an apocalyptic number.
11497134768000 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 11497134768000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22048853598720).
11497134768000 is an abundant number, since it is smaller than the sum of its proper divisors (32600572429440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11497134768000 is an frugal number, since it uses more digits than its factorization.
11497134768000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5172 (or 5067 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 51.
The spelling of 11497134768000 in words is "eleven trillion, four hundred ninety-seven billion, one hundred thirty-four million, seven hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •