Base | Representation |
---|---|
bin | 100100110100011111000… |
… | …0111011111011000001011 |
3 | 122220210001220011211001012 |
4 | 1021220332013133120023 |
5 | 1130402412442004421 |
6 | 14432433505314135 |
7 | 1031416150043453 |
oct | 111507607373013 |
9 | 18823056154035 |
10 | 5060513625611 |
11 | 16811740180a4 |
12 | 69891793594b |
13 | 2a9287067422 |
14 | 136d0453ad63 |
15 | 8b9800ce95b |
hex | 49a3e1df60b |
5060513625611 has 4 divisors (see below), whose sum is σ = 5112683869272. Its totient is φ = 5008343381952.
The previous prime is 5060513625577. The next prime is 5060513625613. The reversal of 5060513625611 is 1165263150605.
5060513625611 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5060513625611 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5060513625613) 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 3 ways as a sum of consecutive naturals, for example, 26085121685 + ... + 26085121878.
It is an arithmetic number, because the mean of its divisors is an integer number (1278170967318).
Almost surely, 25060513625611 is an apocalyptic number.
5060513625611 is a deficient number, since it is larger than the sum of its proper divisors (52170243661).
5060513625611 is an equidigital number, since it uses as much as digits as its factorization.
5060513625611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52170243660.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 5060513625611 in words is "five trillion, sixty billion, five hundred thirteen million, six hundred twenty-five thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •