Base | Representation |
---|---|
bin | 1001111010100000… |
… | …1101011110110001 |
3 | 20212110210010200002 |
4 | 2132220031132301 |
5 | 20422300403410 |
6 | 1120025435345 |
7 | 122644011653 |
oct | 23650153661 |
9 | 6773703602 |
10 | 2661341105 |
11 | 1146291a65 |
12 | 62333bb55 |
13 | 33549c467 |
14 | 1b364c6d3 |
15 | 10899a7a5 |
hex | 9ea0d7b1 |
2661341105 has 8 divisors (see below), whose sum is σ = 3197552064. Its totient is φ = 2126444400.
The previous prime is 2661341051. The next prime is 2661341159. The reversal of 2661341105 is 5011431662.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2661341051) and next prime (2661341159).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2661341105 - 212 = 2661337009 is a prime.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 324101 + ... + 332210.
It is an arithmetic number, because the mean of its divisors is an integer number (399694008).
Almost surely, 22661341105 is an apocalyptic number.
It is an amenable number.
2661341105 is a deficient number, since it is larger than the sum of its proper divisors (536210959).
2661341105 is an equidigital number, since it uses as much as digits as its factorization.
2661341105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657127.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 2661341105 is about 51588.1876498874. The cubic root of 2661341105 is about 1385.7987989363.
Adding to 2661341105 its reverse (5011431662), we get a palindrome (7672772767).
The spelling of 2661341105 in words is "two billion, six hundred sixty-one million, three hundred forty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •