Base | Representation |
---|---|
bin | 100101110001001110000… |
… | …1111000101101011000101 |
3 | 200101020201122121020000021 |
4 | 1023202130033011223011 |
5 | 1140022022033212121 |
6 | 15012404035415141 |
7 | 1044014242246522 |
oct | 113423417055305 |
9 | 20336648536007 |
10 | 5190941694661 |
11 | 17215142938a8 |
12 | 6ba057a544b1 |
13 | 2b867182a648 |
14 | 13d3587d6149 |
15 | 900657ed641 |
hex | 4b89c3c5ac5 |
5190941694661 has 4 divisors (see below), whose sum is σ = 5207632825824. Its totient is φ = 5174250563500.
The previous prime is 5190941694619. The next prime is 5190941694689. The reversal of 5190941694661 is 1664961490915.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5190941694661 is a prime.
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 5190941694661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5190941694161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8345565115 + ... + 8345565736.
It is an arithmetic number, because the mean of its divisors is an integer number (1301908206456).
Almost surely, 25190941694661 is an apocalyptic number.
It is an amenable number.
5190941694661 is a deficient number, since it is larger than the sum of its proper divisors (16691131163).
5190941694661 is a wasteful number, since it uses less digits than its factorization.
5190941694661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16691131162.
The product of its (nonzero) digits is 12597120, while the sum is 61.
The spelling of 5190941694661 in words is "five trillion, one hundred ninety billion, nine hundred forty-one million, six hundred ninety-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •