Base | Representation |
---|---|
bin | 10000000001111010001… |
… | …100000100001011111101 |
3 | 10220022022201111211022101 |
4 | 100001322030010023331 |
5 | 121021444233023010 |
6 | 2202014520145101 |
7 | 142404503126212 |
oct | 20017214041375 |
9 | 3808281454271 |
10 | 1101561611005 |
11 | 3951958a24a9 |
12 | 1595a6908191 |
13 | 7cb5248c85b |
14 | 3b45ca47b09 |
15 | 1d9c2b1a73a |
hex | 1007a3042fd |
1101561611005 has 12 divisors (see below), whose sum is σ = 1395107948412. Its totient is φ = 834867745920.
The previous prime is 1101561610993. The next prime is 1101561611053. The reversal of 1101561611005 is 5001161651011.
It can be written as a sum of positive squares in 2 ways, for example, as 335225946169 + 766335664836 = 578987^2 + 875406^2 .
It is not a de Polignac number, because 1101561611005 - 229 = 1101024740093 is a prime.
It is a super-2 number, since 2×11015616110052 (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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 305139916 + ... + 305143525.
It is an arithmetic number, because the mean of its divisors is an integer number (116258995701).
Almost surely, 21101561611005 is an apocalyptic number.
It is an amenable number.
1101561611005 is a deficient number, since it is larger than the sum of its proper divisors (293546337407).
1101561611005 is an equidigital number, since it uses as much as digits as its factorization.
1101561611005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610283484 (or 610283465 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 28.
The spelling of 1101561611005 in words is "one trillion, one hundred one billion, five hundred sixty-one million, six hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •