Base | Representation |
---|---|
bin | 10000000000100011010… |
… | …100100000001100111011 |
3 | 10220011120011010221021110 |
4 | 100000203110200030323 |
5 | 121011003134030430 |
6 | 2201214135011403 |
7 | 142323415312356 |
oct | 20004324401473 |
9 | 3804504127243 |
10 | 1100104205115 |
11 | 394608164923 |
12 | 15925a809b63 |
13 | 7c97c561ac6 |
14 | 3b36127129d |
15 | 1d939bd67b0 |
hex | 1002352033b |
1100104205115 has 64 divisors (see below), whose sum is σ = 1814615654400. Its totient is φ = 568861947264.
The previous prime is 1100104205111. The next prime is 1100104205117. The reversal of 1100104205115 is 5115024010011.
It is not a de Polignac number, because 1100104205115 - 22 = 1100104205111 is a prime.
It is a super-2 number, since 2×11001042051152 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100104205091 and 1100104205100.
It is not an unprimeable number, because it can be changed into a prime (1100104205111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 68718442 + ... + 68734448.
It is an arithmetic number, because the mean of its divisors is an integer number (28353369600).
Almost surely, 21100104205115 is an apocalyptic number.
1100104205115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1100104205115 is a deficient number, since it is larger than the sum of its proper divisors (714511449285).
1100104205115 is a wasteful number, since it uses less digits than its factorization.
1100104205115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17136.
The product of its (nonzero) digits is 200, while the sum is 21.
Adding to 1100104205115 its reverse (5115024010011), we get a palindrome (6215128215126).
The spelling of 1100104205115 in words is "one trillion, one hundred billion, one hundred four million, two hundred five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •