Base | Representation |
---|---|
bin | 10000000010111011101… |
… | …110001010111010111001 |
3 | 10220102011100100011020012 |
4 | 100002323232022322321 |
5 | 121031222213224041 |
6 | 2202315553311305 |
7 | 142443653311433 |
oct | 20027356127271 |
9 | 3812140304205 |
10 | 1102661070521 |
11 | 3956aa47872a |
12 | 159852b65535 |
13 | 7cc991b150a |
14 | 3b524a85653 |
15 | 1da393e63eb |
hex | 100bbb8aeb9 |
1102661070521 has 4 divisors (see below), whose sum is σ = 1167523486452. Its totient is φ = 1037798654592.
The previous prime is 1102661070463. The next prime is 1102661070551. The reversal of 1102661070521 is 1250701662011.
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 645226627600 + 457434442921 = 803260^2 + 676339^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102661070521 - 226 = 1102593961657 is a prime.
It is a super-2 number, since 2×11026610705212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102661070551) 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, 32431207940 + ... + 32431207973.
It is an arithmetic number, because the mean of its divisors is an integer number (291880871613).
Almost surely, 21102661070521 is an apocalyptic number.
It is an amenable number.
1102661070521 is a deficient number, since it is larger than the sum of its proper divisors (64862415931).
1102661070521 is an equidigital number, since it uses as much as digits as its factorization.
1102661070521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64862415930.
The product of its (nonzero) digits is 5040, while the sum is 32.
The spelling of 1102661070521 in words is "one trillion, one hundred two billion, six hundred sixty-one million, seventy thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •