Base | Representation |
---|---|
bin | 1010000111010010011011… |
… | …0110011001010100001100 |
3 | 1110101002111100221211112002 |
4 | 2201310212312121110030 |
5 | 2424143404430414040 |
6 | 35352334440131432 |
7 | 2225262643306025 |
oct | 241644666312414 |
9 | 43332440854462 |
10 | 11120322123020 |
11 | 35a8113a28900 |
12 | 12b7239466b78 |
13 | 628846283a56 |
14 | 2a63255adc4c |
15 | 1443e9a8da15 |
hex | a1d26d9950c |
11120322123020 has 72 divisors (see below), whose sum is σ = 26051758846512. Its totient is φ = 3983398911360.
The previous prime is 11120322123011. The next prime is 11120322123023. The reversal of 11120322123020 is 2032122302111.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 11120322122983 and 11120322123001.
It is not an unprimeable number, because it can be changed into a prime (11120322123023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34130207 + ... + 34454486.
Almost surely, 211120322123020 is an apocalyptic number.
11120322123020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120322123020 is an abundant number, since it is smaller than the sum of its proper divisors (14931436723492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120322123020 is a wasteful number, since it uses less digits than its factorization.
11120322123020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68584791 (or 68584778 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11120322123020 its reverse (2032122302111), we get a palindrome (13152444425131).
The spelling of 11120322123020 in words is "eleven trillion, one hundred twenty billion, three hundred twenty-two million, one hundred twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •