Base | Representation |
---|---|
bin | 1000110100000000111011111… |
… | …0101100111000011011100001 |
3 | 10000022201212101121212001211022 |
4 | 2031000032332230320123201 |
5 | 1122240341013423412230 |
6 | 10034532402253255225 |
7 | 244423453141100366 |
oct | 21500167654703341 |
9 | 3008655347761738 |
10 | 620140642404065 |
11 | 16a661195670872 |
12 | 596774b2494515 |
13 | 2080501c7a70a3 |
14 | ad1cd7817c46d |
15 | 4ba643436c1e5 |
hex | 23403beb386e1 |
620140642404065 has 8 divisors (see below), whose sum is σ = 744405993973800. Its totient is φ = 495954365197312.
The previous prime is 620140642404037. The next prime is 620140642404077. The reversal of 620140642404065 is 560404246041026.
It can be written as a sum of positive squares in 4 ways, for example, as 79487370593761 + 540653271810304 = 8915569^2 + 23251952^2 .
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 620140642404065 - 212 = 620140642399969 is a prime.
It is a super-2 number, since 2×6201406424040652 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19768573490 + ... + 19768604859.
It is an arithmetic number, because the mean of its divisors is an integer number (93050749246725).
Almost surely, 2620140642404065 is an apocalyptic number.
It is an amenable number.
620140642404065 is a deficient number, since it is larger than the sum of its proper divisors (124265351569735).
620140642404065 is a wasteful number, since it uses less digits than its factorization.
620140642404065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39537181491.
The product of its (nonzero) digits is 1105920, while the sum is 44.
The spelling of 620140642404065 in words is "six hundred twenty trillion, one hundred forty billion, six hundred forty-two million, four hundred four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •