Base | Representation |
---|---|
bin | 1010100100011010111011… |
… | …0001010010010010010100 |
3 | 1112010221100211112211021102 |
4 | 2221012232301102102110 |
5 | 3010343414041104340 |
6 | 40414310322405232 |
7 | 2306401502040164 |
oct | 251065661222224 |
9 | 45127324484242 |
10 | 11620818691220 |
11 | 37803a8219342 |
12 | 1378238800818 |
13 | 663ab925485b |
14 | 2c26447345a4 |
15 | 15243e0ad215 |
hex | a91aec52494 |
11620818691220 has 48 divisors (see below), whose sum is σ = 26040017720640. Its totient is φ = 4343354286336.
The previous prime is 11620818691211. The next prime is 11620818691243. The reversal of 11620818691220 is 2219681802611.
It is a super-2 number, since 2×116208186912202 (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 (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 209431862 + ... + 209487341.
It is an arithmetic number, because the mean of its divisors is an integer number (542500369180).
Almost surely, 211620818691220 is an apocalyptic number.
11620818691220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11620818691220 is an abundant number, since it is smaller than the sum of its proper divisors (14419199029420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11620818691220 is a wasteful number, since it uses less digits than its factorization.
11620818691220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418919304 (or 418919302 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 47.
The spelling of 11620818691220 in words is "eleven trillion, six hundred twenty billion, eight hundred eighteen million, six hundred ninety-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •