Base | Representation |
---|---|
bin | 1010010010111011110111… |
… | …0000011101110111010100 |
3 | 1111002012222200222100010100 |
4 | 2210232331300131313110 |
5 | 2440433211120032040 |
6 | 40024310312054100 |
7 | 2245605422640543 |
oct | 244567560356724 |
9 | 44065880870110 |
10 | 11320422424020 |
11 | 3674a67376696 |
12 | 1329b82694330 |
13 | 6416852c0718 |
14 | 2b1ca8b2015a |
15 | 14970bc26b30 |
hex | a4bbdc1ddd4 |
11320422424020 has 72 divisors (see below), whose sum is σ = 34773280738560. Its totient is φ = 2980566912960.
The previous prime is 11320422424001. The next prime is 11320422424043. The reversal of 11320422424020 is 2042422402311.
It is a happy number.
11320422424020 is a `hidden beast` number, since 1 + 1 + 32 + 0 + 4 + 224 + 2 + 402 + 0 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 398031576 + ... + 398060015.
It is an arithmetic number, because the mean of its divisors is an integer number (482962232480).
Almost surely, 211320422424020 is an apocalyptic number.
11320422424020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11320422424020 is an abundant number, since it is smaller than the sum of its proper divisors (23452858314540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11320422424020 is a wasteful number, since it uses less digits than its factorization.
11320422424020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796091685 (or 796091680 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 11320422424020 its reverse (2042422402311), we get a palindrome (13362844826331).
The spelling of 11320422424020 in words is "eleven trillion, three hundred twenty billion, four hundred twenty-two million, four hundred twenty-four thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •