Base | Representation |
---|---|
bin | 10000000000110000110… |
… | …110011010111101000000 |
3 | 10220012010222021111011021 |
4 | 100000300312122331000 |
5 | 121011434241402240 |
6 | 2201252444155224 |
7 | 142332142612102 |
oct | 20006066327500 |
9 | 3805128244137 |
10 | 1100331200320 |
11 | 394714305770 |
12 | 159302838b14 |
13 | 7c9b75ab4b1 |
14 | 3b38347d572 |
15 | 1d94eac454a |
hex | 10030d9af40 |
1100331200320 has 112 divisors (see below), whose sum is σ = 2886661898496. Its totient is φ = 396158720000.
The previous prime is 1100331200281. The next prime is 1100331200327. The reversal of 1100331200320 is 230021330011.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 1100331200294 and 1100331200303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100331200327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1191976 + ... + 1903015.
Almost surely, 21100331200320 is an apocalyptic number.
1100331200320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100331200320 is an abundant number, since it is smaller than the sum of its proper divisors (1786330698176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100331200320 is a wasteful number, since it uses less digits than its factorization.
1100331200320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3095120 (or 3095110 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1100331200320 its reverse (230021330011), we get a palindrome (1330352530331).
The spelling of 1100331200320 in words is "one trillion, one hundred billion, three hundred thirty-one million, two hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •