Base | Representation |
---|---|
bin | 100101001011010110100… |
… | …0111100100101101100111 |
3 | 200002110211020112111011121 |
4 | 1022112231013210231213 |
5 | 1132204000330334240 |
6 | 14511154405314411 |
7 | 1035105106064542 |
oct | 112265507445547 |
9 | 20073736474147 |
10 | 5109620558695 |
11 | 169aa83663814 |
12 | 6a6341705a07 |
13 | 2b0ab1a9a393 |
14 | 1394423d7859 |
15 | 8cda636704a |
hex | 4a5ad1e4b67 |
5109620558695 has 8 divisors (see below), whose sum is σ = 6139797090336. Its totient is φ = 4082194833696.
The previous prime is 5109620558641. The next prime is 5109620558711. The reversal of 5109620558695 is 5968550269015.
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 5109620558695 - 215 = 5109620525927 is a prime.
It is a super-2 number, since 2×51096205586952 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 687697572 + ... + 687705001.
It is an arithmetic number, because the mean of its divisors is an integer number (767474636292).
Almost surely, 25109620558695 is an apocalyptic number.
5109620558695 is a deficient number, since it is larger than the sum of its proper divisors (1030176531641).
5109620558695 is a wasteful number, since it uses less digits than its factorization.
5109620558695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375403321.
The product of its (nonzero) digits is 29160000, while the sum is 61.
The spelling of 5109620558695 in words is "five trillion, one hundred nine billion, six hundred twenty million, five hundred fifty-eight thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •