Base | Representation |
---|---|
bin | 10000000101001011000… |
… | …001000010111111010101 |
3 | 10220122100220001120220202 |
4 | 100011023001002333111 |
5 | 121101133140120121 |
6 | 2203354313310245 |
7 | 142560354611540 |
oct | 20051301027725 |
9 | 3818326046822 |
10 | 1105065160661 |
11 | 396723524190 |
12 | 15a204105385 |
13 | 8029029ca67 |
14 | 3b6b208b857 |
15 | 1db2a4c940b |
hex | 1014b042fd5 |
1105065160661 has 8 divisors (see below), whose sum is σ = 1377743577024. Its totient is φ = 861089735520.
The previous prime is 1105065160637. The next prime is 1105065160679. The reversal of 1105065160661 is 1660615605011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1105065160661 - 218 = 1105064898517 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105065160681) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 7175747720 + ... + 7175747873.
It is an arithmetic number, because the mean of its divisors is an integer number (172217947128).
Almost surely, 21105065160661 is an apocalyptic number.
1105065160661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1105065160661 is a deficient number, since it is larger than the sum of its proper divisors (272678416363).
1105065160661 is a wasteful number, since it uses less digits than its factorization.
1105065160661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14351495611.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 1105065160661 in words is "one trillion, one hundred five billion, sixty-five million, one hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •