Base | Representation |
---|---|
bin | 10000000101001101000… |
… | …101111111010001101101 |
3 | 10220122110022122011001102 |
4 | 100011031011333101231 |
5 | 121101221100314410 |
6 | 2203402000252445 |
7 | 142561260050063 |
oct | 20051505772155 |
9 | 3818408564042 |
10 | 1105100010605 |
11 | 396741167498 |
12 | 15a213911125 |
13 | 80297582426 |
14 | 3b6b6960033 |
15 | 1db2d5b02a5 |
hex | 1014d17f46d |
1105100010605 has 4 divisors (see below), whose sum is σ = 1326120012732. Its totient is φ = 884080008480.
The previous prime is 1105100010559. The next prime is 1105100010653. The reversal of 1105100010605 is 5060100015011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 661518702244 + 443581308361 = 813338^2 + 666019^2 .
It is not a de Polignac number, because 1105100010605 - 216 = 1105099945069 is a prime.
It is a super-2 number, since 2×11051000106052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110510001056 + ... + 110510001065.
It is an arithmetic number, because the mean of its divisors is an integer number (331530003183).
Almost surely, 21105100010605 is an apocalyptic number.
It is an amenable number.
1105100010605 is a deficient number, since it is larger than the sum of its proper divisors (221020002127).
1105100010605 is an equidigital number, since it uses as much as digits as its factorization.
1105100010605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221020002126.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 1105100010605 its reverse (5060100015011), we get a palindrome (6165200025616).
The spelling of 1105100010605 in words is "one trillion, one hundred five billion, one hundred million, ten thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •