Base | Representation |
---|---|
bin | 100101110001000001011… |
… | …1001111011010010010001 |
3 | 200101012122000221002211101 |
4 | 1023202002321323102101 |
5 | 1140020134234413224 |
6 | 15012253534544401 |
7 | 1044000562063633 |
oct | 113420271732221 |
9 | 20335560832741 |
10 | 5190516716689 |
11 | 1721316408637 |
12 | 6b9b59668101 |
13 | 2b8604781ba5 |
14 | 13d3181aca53 |
15 | 9003d354044 |
hex | 4b882e7b491 |
5190516716689 has 8 divisors (see below), whose sum is σ = 5471951735808. Its totient is φ = 4916206634880.
The previous prime is 5190516716681. The next prime is 5190516716701. The reversal of 5190516716689 is 9866176150915.
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 5190516716689 - 23 = 5190516716681 is a prime.
It is a super-2 number, since 2×51905167166892 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5190516716689.
It is not an unprimeable number, because it can be changed into a prime (5190516716681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1781232832 + ... + 1781235745.
It is an arithmetic number, because the mean of its divisors is an integer number (683993966976).
Almost surely, 25190516716689 is an apocalyptic number.
It is an amenable number.
5190516716689 is a deficient number, since it is larger than the sum of its proper divisors (281435019119).
5190516716689 is a wasteful number, since it uses less digits than its factorization.
5190516716689 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3562468655.
The product of its (nonzero) digits is 24494400, while the sum is 64.
The spelling of 5190516716689 in words is "five trillion, one hundred ninety billion, five hundred sixteen million, seven hundred sixteen thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.701 sec. • engine limits •