Base | Representation |
---|---|
bin | 1010000010111110110000… |
… | …0011001000100011100000 |
3 | 1110010000111010002112120012 |
4 | 2200233230003020203200 |
5 | 2421440331204144324 |
6 | 35254335422504052 |
7 | 2220033064442240 |
oct | 240575403104340 |
9 | 43100433075505 |
10 | 11046321162464 |
11 | 357979a356965 |
12 | 12a4a26735028 |
13 | 621881c6c723 |
14 | 2a2905473b20 |
15 | 1425180b820e |
hex | a0bec0c88e0 |
11046321162464 has 72 divisors (see below), whose sum is σ = 26402236635600. Its totient is φ = 4455658930176.
The previous prime is 11046321162421. The next prime is 11046321162521. The reversal of 11046321162464 is 46426112364011.
It is a super-2 number, since 2×110463211624642 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 85253489 + ... + 85382960.
It is an arithmetic number, because the mean of its divisors is an integer number (366697731050).
Almost surely, 211046321162464 is an apocalyptic number.
11046321162464 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11046321162464 is an abundant number, since it is smaller than the sum of its proper divisors (15355915473136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11046321162464 is a wasteful number, since it uses less digits than its factorization.
11046321162464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170636500 (or 170636475 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 41.
The spelling of 11046321162464 in words is "eleven trillion, forty-six billion, three hundred twenty-one million, one hundred sixty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •