Base | Representation |
---|---|
bin | 101001000011010110100… |
… | …0110110011100101101111 |
3 | 201222101111100202102121111 |
4 | 1102012231012303211233 |
5 | 1214420204223132231 |
6 | 15555553400012451 |
7 | 1121430612156301 |
oct | 122065506634557 |
9 | 21871440672544 |
10 | 5642196302191 |
11 | 18859297a2479 |
12 | 7715b4161127 |
13 | 31c097b0c507 |
14 | 157125b91971 |
15 | 9bb76cb24b1 |
hex | 521ad1b396f |
5642196302191 has 8 divisors (see below), whose sum is σ = 5842046537280. Its totient is φ = 5442698849952.
The previous prime is 5642196302173. The next prime is 5642196302219. The reversal of 5642196302191 is 1912036912465.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5642196302191 - 27 = 5642196302063 is a prime.
It is a super-2 number, since 2×56421963021912 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5642196302101) 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 7 ways as a sum of consecutive naturals, for example, 88163160 + ... + 88227133.
It is an arithmetic number, because the mean of its divisors is an integer number (730255817160).
Almost surely, 25642196302191 is an apocalyptic number.
5642196302191 is a deficient number, since it is larger than the sum of its proper divisors (199850235089).
5642196302191 is a wasteful number, since it uses less digits than its factorization.
5642196302191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176391425.
The product of its (nonzero) digits is 699840, while the sum is 49.
The spelling of 5642196302191 in words is "five trillion, six hundred forty-two billion, one hundred ninety-six million, three hundred two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •