Base | Representation |
---|---|
bin | 110000100111001101111… |
… | …110000111011001101001 |
3 | 102211100210022022110210001 |
4 | 300213031332013121221 |
5 | 414213120132422023 |
6 | 11034400552223001 |
7 | 463232205460264 |
oct | 60471576073151 |
9 | 12740708273701 |
10 | 3340645201513 |
11 | 107883a142504 |
12 | 45b53339aa61 |
13 | 1b30382a4bb9 |
14 | b798c197cdb |
15 | 5bd703856ad |
hex | 309cdf87669 |
3340645201513 has 24 divisors (see below), whose sum is σ = 3587011315712. Its totient is φ = 3107216264544.
The previous prime is 3340645201507. The next prime is 3340645201519. The reversal of 3340645201513 is 3151025460433.
It is an interprime number because it is at equal distance from previous prime (3340645201507) and next prime (3340645201519).
It is not a de Polignac number, because 3340645201513 - 29 = 3340645201001 is a prime.
It is a super-2 number, since 2×33406452015132 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (3340645201519) 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 23 ways as a sum of consecutive naturals, for example, 3039256 + ... + 3989782.
Almost surely, 23340645201513 is an apocalyptic number.
It is an amenable number.
3340645201513 is a deficient number, since it is larger than the sum of its proper divisors (246366114199).
3340645201513 is an equidigital number, since it uses as much as digits as its factorization.
3340645201513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950701 (or 950654 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 37.
The spelling of 3340645201513 in words is "three trillion, three hundred forty billion, six hundred forty-five million, two hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •