Base | Representation |
---|---|
bin | 1010101000000010000101… |
… | …1110001001101000010011 |
3 | 1112100212112110220212002111 |
4 | 2222000201132021220103 |
5 | 3012403010341101021 |
6 | 40503012041130151 |
7 | 2314026321402340 |
oct | 252004136115023 |
9 | 45325473825074 |
10 | 11682872597011 |
11 | 37a4751011200 |
12 | 1388276489957 |
13 | 6698c83811c5 |
14 | 2c564dcb57c7 |
15 | 153d71cc08e1 |
hex | aa021789a13 |
11682872597011 has 48 divisors (see below), whose sum is σ = 15332395216320. Its totient is φ = 8702594208000.
The previous prime is 11682872596943. The next prime is 11682872597041. The reversal of 11682872597011 is 11079527828611.
It is not a de Polignac number, because 11682872597011 - 219 = 11682872072723 is a prime.
It is a super-2 number, since 2×116828725970112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11682872597041) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 126265 + ... + 4835461.
It is an arithmetic number, because the mean of its divisors is an integer number (319424900340).
Almost surely, 211682872597011 is an apocalyptic number.
11682872597011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11682872597011 is a deficient number, since it is larger than the sum of its proper divisors (3649522619309).
11682872597011 is a wasteful number, since it uses less digits than its factorization.
11682872597011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4709356 (or 4709345 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 58.
The spelling of 11682872597011 in words is "eleven trillion, six hundred eighty-two billion, eight hundred seventy-two million, five hundred ninety-seven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •