Base | Representation |
---|---|
bin | 100000110100001… |
… | …0111011111001101 |
3 | 2211201220201121201 |
4 | 1001220113133031 |
5 | 4223340213010 |
6 | 301132225501 |
7 | 36200130004 |
oct | 10150273715 |
9 | 2751821551 |
10 | 1101101005 |
11 | 5155a7534 |
12 | 26890b291 |
13 | 147177b74 |
14 | a6347c3b |
15 | 66a0223a |
hex | 41a177cd |
1101101005 has 4 divisors (see below), whose sum is σ = 1321321212. Its totient is φ = 880880800.
The previous prime is 1101100993. The next prime is 1101101009. The reversal of 1101101005 is 5001011011.
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 838855369 + 262245636 = 28963^2 + 16194^2 .
It is not a de Polignac number, because 1101101005 - 27 = 1101100877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101100982 and 1101101000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101101009) 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, 110110096 + ... + 110110105.
It is an arithmetic number, because the mean of its divisors is an integer number (330330303).
Almost surely, 21101101005 is an apocalyptic number.
It is an amenable number.
1101101005 is a deficient number, since it is larger than the sum of its proper divisors (220220207).
1101101005 is an equidigital number, since it uses as much as digits as its factorization.
1101101005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220220206.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 1101101005 is about 33182.8420271682. The cubic root of 1101101005 is about 1032.6244083608.
Adding to 1101101005 its reverse (5001011011), we get a palindrome (6102112016).
The spelling of 1101101005 in words is "one billion, one hundred one million, one hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •