Base | Representation |
---|---|
bin | 10000000110101010000… |
… | …000000010011101100001 |
3 | 10220210110221122101122202 |
4 | 100012222000002131201 |
5 | 121112414113404443 |
6 | 2204220401142545 |
7 | 142645015005002 |
oct | 20065200023541 |
9 | 3823427571582 |
10 | 1106658731873 |
11 | 397371004892 |
12 | 15a58992aa55 |
13 | 804854945c6 |
14 | 3b7c398b1a9 |
15 | 1dbc03587b8 |
hex | 101aa002761 |
1106658731873 has 4 divisors (see below), whose sum is σ = 1107188489220. Its totient is φ = 1106128974528.
The previous prime is 1106658731869. The next prime is 1106658731911. The reversal of 1106658731873 is 3781378566011.
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 545931832384 + 560726899489 = 738872^2 + 748817^2 .
It is a cyclic number.
It is not a de Polignac number, because 1106658731873 - 22 = 1106658731869 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1106658731863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 264875540 + ... + 264879717.
It is an arithmetic number, because the mean of its divisors is an integer number (276797122305).
Almost surely, 21106658731873 is an apocalyptic number.
It is an amenable number.
1106658731873 is a deficient number, since it is larger than the sum of its proper divisors (529757347).
1106658731873 is an equidigital number, since it uses as much as digits as its factorization.
1106658731873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529757346.
The product of its (nonzero) digits is 5080320, while the sum is 56.
The spelling of 1106658731873 in words is "one trillion, one hundred six billion, six hundred fifty-eight million, seven hundred thirty-one thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •