Base | Representation |
---|---|
bin | 10000000000100101000… |
… | …011001010001110101110 |
3 | 10220011122011201200202100 |
4 | 100000211003022032232 |
5 | 121011033100304402 |
6 | 2201221052435530 |
7 | 142324220006640 |
oct | 20004503121656 |
9 | 3804564650670 |
10 | 1100133213102 |
11 | 394622577a70 |
12 | 159268478ba6 |
13 | 7c98557a3b1 |
14 | 3b365062890 |
15 | 1d93c51671c |
hex | 100250ca3ae |
1100133213102 has 192 divisors, whose sum is σ = 3236069491200. Its totient is φ = 261374480640.
The previous prime is 1100133213097. The next prime is 1100133213139. The reversal of 1100133213102 is 2013123310011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 43408 + ... + 1483964.
It is an arithmetic number, because the mean of its divisors is an integer number (16854528600).
Almost surely, 21100133213102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1100133213102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1618034745600).
1100133213102 is an abundant number, since it is smaller than the sum of its proper divisors (2135936278098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100133213102 is a wasteful number, since it uses less digits than its factorization.
1100133213102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440631 (or 1440628 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1100133213102 its reverse (2013123310011), we get a palindrome (3113256523113).
The spelling of 1100133213102 in words is "one trillion, one hundred billion, one hundred thirty-three million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •