Base | Representation |
---|---|
bin | 100101001001101100001… |
… | …0011001010101000101001 |
3 | 200002010121101222212212002 |
4 | 1022103120103022220221 |
5 | 1132124142303104401 |
6 | 14505404221100345 |
7 | 1034620452214133 |
oct | 112233023125051 |
9 | 20063541885762 |
10 | 5106050050601 |
11 | 1699511159185 |
12 | 6a57059b76b5 |
13 | 2b0663144bb6 |
14 | 1391c4124053 |
15 | 8cc47b7da6b |
hex | 4a4d84caa29 |
5106050050601 has 4 divisors (see below), whose sum is σ = 5106058188672. Its totient is φ = 5106041912532.
The previous prime is 5106050050589. The next prime is 5106050050679. The reversal of 5106050050601 is 1060500506015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5106050050601 - 210 = 5106050049577 is a prime.
It is a super-2 number, since 2×51060500506012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5106050050681) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3041381 + ... + 4411586.
It is an arithmetic number, because the mean of its divisors is an integer number (1276514547168).
Almost surely, 25106050050601 is an apocalyptic number.
It is an amenable number.
5106050050601 is a deficient number, since it is larger than the sum of its proper divisors (8138071).
5106050050601 is an equidigital number, since it uses as much as digits as its factorization.
5106050050601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8138070.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 5106050050601 its reverse (1060500506015), we get a palindrome (6166550556616).
The spelling of 5106050050601 in words is "five trillion, one hundred six billion, fifty million, fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •