Base | Representation |
---|---|
bin | 100101000111011010110… |
… | …0001101001010000000111 |
3 | 200001200000102110210012111 |
4 | 1022032311201221100013 |
5 | 1132034144422114132 |
6 | 14503240152401451 |
7 | 1034355534551140 |
oct | 112166541512007 |
9 | 20050012423174 |
10 | 5101171676167 |
11 | 1697438473276 |
12 | 6a47840a6287 |
13 | 2b006655c0c8 |
14 | 138c80282ac7 |
15 | 8ca5e74e647 |
hex | 4a3b5869407 |
5101171676167 has 8 divisors (see below), whose sum is σ = 5829924292256. Its totient is φ = 4372422511392.
The previous prime is 5101171676113. The next prime is 5101171676189. The reversal of 5101171676167 is 7616761711015.
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 5101171676167 - 27 = 5101171676039 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 5101171676167.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101171626167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4667773 + ... + 5656009.
It is an arithmetic number, because the mean of its divisors is an integer number (728740536532).
Almost surely, 25101171676167 is an apocalyptic number.
5101171676167 is a deficient number, since it is larger than the sum of its proper divisors (728752616089).
5101171676167 is an equidigital number, since it uses as much as digits as its factorization.
5101171676167 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1725657.
The product of its (nonzero) digits is 370440, while the sum is 49.
The spelling of 5101171676167 in words is "five trillion, one hundred one billion, one hundred seventy-one million, six hundred seventy-six thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •