Base | Representation |
---|---|
bin | 110000001110011110010… |
… | …111001011101101010101 |
3 | 102201211012200220212002210 |
4 | 300032132113023231111 |
5 | 413244212111200423 |
6 | 11014244340224033 |
7 | 461301623561223 |
oct | 60163627135525 |
9 | 12654180825083 |
10 | 3314076662613 |
11 | 1068545972a42 |
12 | 45635969b019 |
13 | 1b0692acc972 |
14 | b658b789b13 |
15 | 5b317b2ab93 |
hex | 3039e5cbb55 |
3314076662613 has 8 divisors (see below), whose sum is σ = 4421518590528. Its totient is φ = 2208009588224.
The previous prime is 3314076662591. The next prime is 3314076662639. The reversal of 3314076662613 is 3162666704133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3314076662613 - 26 = 3314076662549 is a prime.
It is a super-2 number, since 2×33140766626132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3314076662683) 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, 343707756 + ... + 343717397.
It is an arithmetic number, because the mean of its divisors is an integer number (552689823816).
Almost surely, 23314076662613 is an apocalyptic number.
It is an amenable number.
3314076662613 is a deficient number, since it is larger than the sum of its proper divisors (1107441927915).
3314076662613 is a wasteful number, since it uses less digits than its factorization.
3314076662613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 687426763.
The product of its (nonzero) digits is 1959552, while the sum is 48.
The spelling of 3314076662613 in words is "three trillion, three hundred fourteen billion, seventy-six million, six hundred sixty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.383 sec. • engine limits •