Base | Representation |
---|---|
bin | 100100110000000100010… |
… | …0011011110000100000101 |
3 | 122212212120121202112112021 |
4 | 1021200020203132010011 |
5 | 1130223444403243010 |
6 | 14424224152323141 |
7 | 1030632052403305 |
oct | 111401043360405 |
9 | 18785517675467 |
10 | 5051025056005 |
11 | 1678144a67335 |
12 | 696b0a0a34b1 |
13 | 2a84043049b6 |
14 | 1366842a7605 |
15 | 8b5c70968da |
hex | 498088de105 |
5051025056005 has 4 divisors (see below), whose sum is σ = 6061230067212. Its totient is φ = 4040820044800.
The previous prime is 5051025056003. The next prime is 5051025056029. The reversal of 5051025056005 is 5006505201505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3098099860164 + 1952925195841 = 1760142^2 + 1397471^2 .
It is not a de Polignac number, because 5051025056005 - 21 = 5051025056003 is a prime.
It is a super-3 number, since 3×50510250560053 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5051025056003) 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, 505102505596 + ... + 505102505605.
It is an arithmetic number, because the mean of its divisors is an integer number (1515307516803).
Almost surely, 25051025056005 is an apocalyptic number.
It is an amenable number.
5051025056005 is a deficient number, since it is larger than the sum of its proper divisors (1010205011207).
5051025056005 is a wasteful number, since it uses less digits than its factorization.
5051025056005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010205011206.
The product of its (nonzero) digits is 37500, while the sum is 34.
The spelling of 5051025056005 in words is "five trillion, fifty-one billion, twenty-five million, fifty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •