Base | Representation |
---|---|
bin | 11111111101010110001… |
… | …100100111011001000001 |
3 | 21202221201011122202002102 |
4 | 133331112030213121001 |
5 | 241440231123422110 |
6 | 4400524132000145 |
7 | 314445151461002 |
oct | 37752614473101 |
9 | 7687634582072 |
10 | 2196174435905 |
11 | 77743524006a |
12 | 2b5772460055 |
13 | 12c138138248 |
14 | 7841c8671a9 |
15 | 3c1da6865a5 |
hex | 1ff56327641 |
2196174435905 has 8 divisors (see below), whose sum is σ = 2678612754984. Its totient is φ = 1728137260800.
The previous prime is 2196174435901. The next prime is 2196174435907. The reversal of 2196174435905 is 5095344716912.
It can be written as a sum of positive squares in 4 ways, for example, as 119970098689 + 2076204337216 = 346367^2 + 1440904^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2196174435905 - 22 = 2196174435901 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2196174435901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3600285656 + ... + 3600286265.
It is an arithmetic number, because the mean of its divisors is an integer number (334826594373).
Almost surely, 22196174435905 is an apocalyptic number.
It is an amenable number.
2196174435905 is a deficient number, since it is larger than the sum of its proper divisors (482438319079).
2196174435905 is an equidigital number, since it uses as much as digits as its factorization.
2196174435905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7200571987.
The product of its (nonzero) digits is 8164800, while the sum is 56.
The spelling of 2196174435905 in words is "two trillion, one hundred ninety-six billion, one hundred seventy-four million, four hundred thirty-five thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •