Base | Representation |
---|---|
bin | 10000000000010101111… |
… | …111110111001010011000 |
3 | 10220010222120120012122000 |
4 | 100000111333313022120 |
5 | 121010023424042303 |
6 | 2201140032201000 |
7 | 142315032416640 |
oct | 20002577671230 |
9 | 3803876505560 |
10 | 1099880690328 |
11 | 394502a80962 |
12 | 1591b7999160 |
13 | 7c945163634 |
14 | 3b33d6cb520 |
15 | 1d925284da3 |
hex | 10015ff7298 |
1099880690328 has 128 divisors (see below), whose sum is σ = 3586054771200. Its totient is φ = 305758323072.
The previous prime is 1099880690327. The next prime is 1099880690387. The reversal of 1099880690328 is 8230960889901.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1099880690327) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 9774250 + ... + 9886137.
It is an arithmetic number, because the mean of its divisors is an integer number (28016052900).
Almost surely, 21099880690328 is an apocalyptic number.
1099880690328 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1099880690328 is an abundant number, since it is smaller than the sum of its proper divisors (2486174080872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1099880690328 is a wasteful number, since it uses less digits than its factorization.
1099880690328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19660446 (or 19660436 counting only the distinct ones).
The product of its (nonzero) digits is 13436928, while the sum is 63.
The spelling of 1099880690328 in words is "one trillion, ninety-nine billion, eight hundred eighty million, six hundred ninety thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •