Base | Representation |
---|---|
bin | 10000000001101100011… |
… | …011111001100001011000 |
3 | 10220021201122100111200211 |
4 | 100001230123321201120 |
5 | 121021011201134400 |
6 | 2201535554540504 |
7 | 142366002011626 |
oct | 20015433714130 |
9 | 3807648314624 |
10 | 1101330880600 |
11 | 395087630315 |
12 | 159541597734 |
13 | 7cb16735ca2 |
14 | 3b43a146516 |
15 | 1d9ac740dba |
hex | 1006c6f9858 |
1101330880600 has 96 divisors (see below), whose sum is σ = 2686526087040. Its totient is φ = 419332608000.
The previous prime is 1101330880583. The next prime is 1101330880621. The reversal of 1101330880600 is 60880331011.
It is a super-3 number, since 3×11013308806003 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
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 23 ways as a sum of consecutive naturals, for example, 1077817 + ... + 1834216.
It is an arithmetic number, because the mean of its divisors is an integer number (27984646740).
Almost surely, 21101330880600 is an apocalyptic number.
1101330880600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101330880600 is an abundant number, since it is smaller than the sum of its proper divisors (1585195206440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101330880600 is a wasteful number, since it uses less digits than its factorization.
1101330880600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2912141 (or 2912132 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 31.
The spelling of 1101330880600 in words is "one trillion, one hundred one billion, three hundred thirty million, eight hundred eighty thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •