Base | Representation |
---|---|
bin | 1010000010011010111001… |
… | …1111011001110110000000 |
3 | 1110002002122111021011110110 |
4 | 2200212232133121312000 |
5 | 2421311124300420303 |
6 | 35250104514431320 |
7 | 2216242450651644 |
oct | 240465637316600 |
9 | 43062574234413 |
10 | 11036698451328 |
11 | 3575701605630 |
12 | 12a2b9bb92540 |
13 | 6209aa4a1404 |
14 | 2a2271482c24 |
15 | 1421533d4703 |
hex | a09ae7d9d80 |
11036698451328 has 128 divisors (see below), whose sum is σ = 33012998691840. Its totient is φ = 3236568422400.
The previous prime is 11036698451327. The next prime is 11036698451329. The reversal of 11036698451328 is 82315489663011.
It is an interprime number because it is at equal distance from previous prime (11036698451327) and next prime (11036698451329).
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11036698451327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42011875 + ... + 42273762.
It is an arithmetic number, because the mean of its divisors is an integer number (257914052280).
Almost surely, 211036698451328 is an apocalyptic number.
It is an amenable number.
11036698451328 is an abundant number, since it is smaller than the sum of its proper divisors (21976300240512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11036698451328 is a wasteful number, since it uses less digits than its factorization.
11036698451328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84285696 (or 84285684 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 57.
The spelling of 11036698451328 in words is "eleven trillion, thirty-six billion, six hundred ninety-eight million, four hundred fifty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •