Base | Representation |
---|---|
bin | 1010000000010010001111… |
… | …0100111010111001000000 |
3 | 1102221120221202211121121120 |
4 | 2200010203310322321000 |
5 | 2420211011123222240 |
6 | 35221200315352240 |
7 | 2213503362665532 |
oct | 240044364727100 |
9 | 42846852747546 |
10 | 11000012320320 |
11 | 35610962043a1 |
12 | 1297a61a52680 |
13 | 61a3b1b48a9a |
14 | 2a0591061852 |
15 | 1412077dead0 |
hex | a0123d3ae40 |
11000012320320 has 112 divisors (see below), whose sum is σ = 34927174158720. Its totient is φ = 2933157298176.
The previous prime is 11000012320303. The next prime is 11000012320351. The reversal of 11000012320320 is 2302321000011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11000012320320.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15746784 + ... + 16430496.
Almost surely, 211000012320320 is an apocalyptic number.
11000012320320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000012320320 is an abundant number, since it is smaller than the sum of its proper divisors (23927161838400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000012320320 is a wasteful number, since it uses less digits than its factorization.
11000012320320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700492 (or 700482 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11000012320320 its reverse (2302321000011), we get a palindrome (13302333320331).
The spelling of 11000012320320 in words is "eleven trillion, twelve million, three hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •