Base | Representation |
---|---|
bin | 100101001000111001100… |
… | …1101100001011011000001 |
3 | 200001222020012201020221100 |
4 | 1022101303031201123001 |
5 | 1132112204120303012 |
6 | 14504524034245013 |
7 | 1034530436511636 |
oct | 112216315413301 |
9 | 20058205636840 |
10 | 5104354072257 |
11 | 1698820892590 |
12 | 6a5311a26769 |
13 | 2b045297600b |
14 | 1390a2ba818d |
15 | 8cb98d218dc |
hex | 4a4733616c1 |
5104354072257 has 24 divisors (see below), whose sum is σ = 8043984119808. Its totient is φ = 3093255799200.
The previous prime is 5104354072247. The next prime is 5104354072291. The reversal of 5104354072257 is 7522704534015.
5104354072257 is a `hidden beast` number, since 5 + 10 + 4 + 3 + 5 + 407 + 225 + 7 = 666.
It is not a de Polignac number, because 5104354072257 - 216 = 5104354006721 is a prime.
It is a super-3 number, since 3×51043540722573 (a number of 39 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (5104354072247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1378369 + ... + 3479742.
It is an arithmetic number, because the mean of its divisors is an integer number (335166004992).
Almost surely, 25104354072257 is an apocalyptic number.
It is an amenable number.
5104354072257 is a deficient number, since it is larger than the sum of its proper divisors (2939630047551).
5104354072257 is a wasteful number, since it uses less digits than its factorization.
5104354072257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4868741 (or 4868738 counting only the distinct ones).
The product of its (nonzero) digits is 1176000, while the sum is 45.
The spelling of 5104354072257 in words is "five trillion, one hundred four billion, three hundred fifty-four million, seventy-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •