Base | Representation |
---|---|
bin | 110000100110111011110… |
… | …010001000100100110001 |
3 | 102211100000001011020000000 |
4 | 300212323302020210301 |
5 | 414212004024230310 |
6 | 11034310412220213 |
7 | 463221512061141 |
oct | 60467362104461 |
9 | 12740001136000 |
10 | 3340340070705 |
11 | 10786a2984190 |
12 | 45b46916a669 |
13 | 1b2cb9ccb921 |
14 | b795d84a921 |
15 | 5bd536b14c0 |
hex | 309bbc88931 |
3340340070705 has 128 divisors (see below), whose sum is σ = 6560709004800. Its totient is φ = 1618942671360.
The previous prime is 3340340070689. The next prime is 3340340070707. The reversal of 3340340070705 is 5070700430433.
It is not a de Polignac number, because 3340340070705 - 24 = 3340340070689 is a prime.
It is a super-2 number, since 2×33403400707052 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3340340070705.
It is not an unprimeable number, because it can be changed into a prime (3340340070707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 590476237 + ... + 590481893.
It is an arithmetic number, because the mean of its divisors is an integer number (51255539100).
Almost surely, 23340340070705 is an apocalyptic number.
It is an amenable number.
3340340070705 is a deficient number, since it is larger than the sum of its proper divisors (3220368934095).
3340340070705 is an equidigital number, since it uses as much as digits as its factorization.
3340340070705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10603 (or 10585 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 36.
The spelling of 3340340070705 in words is "three trillion, three hundred forty billion, three hundred forty million, seventy thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •