Base | Representation |
---|---|
bin | 100101011010000010101… |
… | …1110010001110101011111 |
3 | 200012111020211000010120001 |
4 | 1022310011132101311133 |
5 | 1133213102411124032 |
6 | 14533453025435131 |
7 | 1040302633133653 |
oct | 112640536216537 |
9 | 20174224003501 |
10 | 5141167676767 |
11 | 17023a213a521 |
12 | 6b048679baa7 |
13 | 2b3a6b841155 |
14 | 13ab960cca63 |
15 | 8db00be63e7 |
hex | 4ad05791d5f |
5141167676767 has 8 divisors (see below), whose sum is σ = 5191360046496. Its totient is φ = 5090980655712.
The previous prime is 5141167676681. The next prime is 5141167676791. The reversal of 5141167676767 is 7676767611415.
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 5141167676767 - 223 = 5141159288159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5141167676699 and 5141167676708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5141167376767) 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, 608373 + ... + 3263809.
It is an arithmetic number, because the mean of its divisors is an integer number (648920005812).
Almost surely, 25141167676767 is an apocalyptic number.
5141167676767 is a deficient number, since it is larger than the sum of its proper divisors (50192369729).
5141167676767 is a wasteful number, since it uses less digits than its factorization.
5141167676767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2674337.
The product of its digits is 62233920, while the sum is 64.
The spelling of 5141167676767 in words is "five trillion, one hundred forty-one billion, one hundred sixty-seven million, six hundred seventy-six thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •