Base | Representation |
---|---|
bin | 10000011101011100110… |
… | …010000000010101111000 |
3 | 11000010122121022121110002 |
4 | 100131130302000111320 |
5 | 122013030022330240 |
6 | 2223345122012132 |
7 | 144502346646254 |
oct | 20353462002570 |
9 | 4003577277402 |
10 | 1131133011320 |
11 | 3a6790107214 |
12 | 16327a1a7048 |
13 | 82885b0b870 |
14 | 3ca661a5264 |
15 | 1e653cd1d15 |
hex | 1075cc80578 |
1131133011320 has 128 divisors (see below), whose sum is σ = 2949623087040. Its totient is φ = 386637373440.
The previous prime is 1131133011319. The next prime is 1131133011331. The reversal of 1131133011320 is 231103311311.
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 = 1131133011292 and 1131133011301.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 509582 + ... + 1588061.
Almost surely, 21131133011320 is an apocalyptic number.
1131133011320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131133011320 is an abundant number, since it is smaller than the sum of its proper divisors (1818490075720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131133011320 is a wasteful number, since it uses less digits than its factorization.
1131133011320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2097745 (or 2097741 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1131133011320 its reverse (231103311311), we get a palindrome (1362236322631).
The spelling of 1131133011320 in words is "one trillion, one hundred thirty-one billion, one hundred thirty-three million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •