Base | Representation |
---|---|
bin | 100100011101100010101… |
… | …0101100111100000111111 |
3 | 122202001220010010200210110 |
4 | 1020323011111213200333 |
5 | 1124101011104124232 |
6 | 14354044425241103 |
7 | 1025023156446354 |
oct | 110730525474077 |
9 | 18661803120713 |
10 | 5011242645567 |
11 | 166228a915584 |
12 | 68b267033193 |
13 | 2a4734357972 |
14 | 13478c97a62b |
15 | 8a549740acc |
hex | 48ec556783f |
5011242645567 has 8 divisors (see below), whose sum is σ = 7074695499696. Its totient is φ = 3144309110912.
The previous prime is 5011242645559. The next prime is 5011242645589. The reversal of 5011242645567 is 7655462421105.
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 5011242645567 - 23 = 5011242645559 is a prime.
It is a super-2 number, since 2×50112426455672 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011242645547) 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, 49129829808 + ... + 49129829909.
It is an arithmetic number, because the mean of its divisors is an integer number (884336937462).
Almost surely, 25011242645567 is an apocalyptic number.
5011242645567 is a deficient number, since it is larger than the sum of its proper divisors (2063452854129).
5011242645567 is a wasteful number, since it uses less digits than its factorization.
5011242645567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98259659737.
The product of its (nonzero) digits is 2016000, while the sum is 48.
The spelling of 5011242645567 in words is "five trillion, eleven billion, two hundred forty-two million, six hundred forty-five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •