Base | Representation |
---|---|
bin | 1010000101110110011011… |
… | …1111110111110101110000 |
3 | 1110021201202102122010011220 |
4 | 2201131212333313311300 |
5 | 2423242321401423032 |
6 | 35333132243105040 |
7 | 2223430006333236 |
oct | 241354677676560 |
9 | 43251672563156 |
10 | 11095628545392 |
11 | 35986a2062506 |
12 | 12b24a7672180 |
13 | 62640c386661 |
14 | 2a5061bcc956 |
15 | 143951c4812c |
hex | a1766ff7d70 |
11095628545392 has 80 divisors (see below), whose sum is σ = 28814062701600. Its totient is φ = 3679144574976.
The previous prime is 11095628545369. The next prime is 11095628545399. The reversal of 11095628545392 is 29354582659011.
It is a super-2 number, since 2×110956285453922 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11095628545399) 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, 203752984 + ... + 203807432.
It is an arithmetic number, because the mean of its divisors is an integer number (360175783770).
Almost surely, 211095628545392 is an apocalyptic number.
11095628545392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11095628545392 is an abundant number, since it is smaller than the sum of its proper divisors (17718434156208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11095628545392 is a wasteful number, since it uses less digits than its factorization.
11095628545392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76650 (or 76644 counting only the distinct ones).
The product of its (nonzero) digits is 23328000, while the sum is 60.
The spelling of 11095628545392 in words is "eleven trillion, ninety-five billion, six hundred twenty-eight million, five hundred forty-five thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •