Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100111000111011111000 |
3 | 10220011112212102222202001 |
4 | 100000203010320323320 |
5 | 121011001112041440 |
6 | 2201213511150344 |
7 | 142323335444422 |
oct | 20004304707370 |
9 | 3804485388661 |
10 | 1100100112120 |
11 | 394605919789 |
12 | 1592593753b4 |
13 | 7c97b75ab09 |
14 | 3b3608c7812 |
15 | 1d939678b9a |
hex | 10023138ef8 |
1100100112120 has 16 divisors (see below), whose sum is σ = 2475225252360. Its totient is φ = 440040044832.
The previous prime is 1100100112103. The next prime is 1100100112123. The reversal of 1100100112120 is 212110010011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1100100112097 and 1100100112106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100100112123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13751251362 + ... + 13751251441.
Almost surely, 21100100112120 is an apocalyptic number.
1100100112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100100112120 is an abundant number, since it is smaller than the sum of its proper divisors (1375125140240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100100112120 is a wasteful number, since it uses less digits than its factorization.
1100100112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27502502814 (or 27502502810 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100100112120 its reverse (212110010011), we get a palindrome (1312210122131).
The spelling of 1100100112120 in words is "one trillion, one hundred billion, one hundred million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •