Base | Representation |
---|---|
bin | 100100100101110000001… |
… | …1011011110100010001001 |
3 | 122210202102002100112022100 |
4 | 1021023200123132202021 |
5 | 1124343120010120112 |
6 | 14410122331344013 |
7 | 1026216155341356 |
oct | 111134033364211 |
9 | 18722362315270 |
10 | 5028877035657 |
11 | 1669809a90892 |
12 | 6927688b2009 |
13 | 2a62b48c7c07 |
14 | 1355829d562d |
15 | 8ac2c97a2dc |
hex | 492e06de889 |
5028877035657 has 12 divisors (see below), whose sum is σ = 7264772109504. Its totient is φ = 3352197638040.
The previous prime is 5028877035641. The next prime is 5028877035671. The reversal of 5028877035657 is 7565307788205.
5028877035657 is a `hidden beast` number, since 502 + 8 + 8 + 7 + 70 + 3 + 5 + 6 + 57 = 666.
It is not a de Polignac number, because 5028877035657 - 24 = 5028877035641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5028877035594 and 5028877035603.
It is not an unprimeable number, because it can be changed into a prime (5028877035857) 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 11 ways as a sum of consecutive naturals, for example, 32172069 + ... + 32328002.
It is an arithmetic number, because the mean of its divisors is an integer number (605397675792).
Almost surely, 25028877035657 is an apocalyptic number.
It is an amenable number.
5028877035657 is a deficient number, since it is larger than the sum of its proper divisors (2235895073847).
5028877035657 is a wasteful number, since it uses less digits than its factorization.
5028877035657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64508740 (or 64508737 counting only the distinct ones).
The product of its (nonzero) digits is 98784000, while the sum is 63.
The spelling of 5028877035657 in words is "five trillion, twenty-eight billion, eight hundred seventy-seven million, thirty-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •