Base | Representation |
---|---|
bin | 100000010000011011100… |
… | …011100110000101100101 |
3 | 21211220121020002122011201 |
4 | 200100123203212011211 |
5 | 242304212323044423 |
6 | 4414153321202501 |
7 | 316102015235341 |
oct | 40203343460545 |
9 | 7756536078151 |
10 | 2216665440613 |
11 | 78509a9421a8 |
12 | 2b9730930431 |
13 | 1310524687c0 |
14 | 79404042621 |
15 | 3c9d95902ad |
hex | 2041b8e6165 |
2216665440613 has 4 divisors (see below), whose sum is σ = 2387178166828. Its totient is φ = 2046152714400.
The previous prime is 2216665440611. The next prime is 2216665440617. The reversal of 2216665440613 is 3160445666122.
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 1093578422049 + 1123087018564 = 1045743^2 + 1059758^2 .
It is a cyclic number.
It is not a de Polignac number, because 2216665440613 - 21 = 2216665440611 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2216665440611) 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 3 ways as a sum of consecutive naturals, for example, 85256363088 + ... + 85256363113.
It is an arithmetic number, because the mean of its divisors is an integer number (596794541707).
Almost surely, 22216665440613 is an apocalyptic number.
It is an amenable number.
2216665440613 is a deficient number, since it is larger than the sum of its proper divisors (170512726215).
2216665440613 is a wasteful number, since it uses less digits than its factorization.
2216665440613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170512726214.
The product of its (nonzero) digits is 1244160, while the sum is 46.
The spelling of 2216665440613 in words is "two trillion, two hundred sixteen billion, six hundred sixty-five million, four hundred forty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.704 sec. • engine limits •