Base | Representation |
---|---|
bin | 1000111111100110… |
… | …10110110110110101 |
3 | 110110111201102122122 |
4 | 10133303112312311 |
5 | 34342100231312 |
6 | 2115044005325 |
7 | 230440530215 |
oct | 43763266665 |
9 | 13414642578 |
10 | 4828523957 |
11 | 2058637574 |
12 | b29090845 |
13 | 5bc48078a |
14 | 33b3c6245 |
15 | 1d3d83b72 |
hex | 11fcd6db5 |
4828523957 has 8 divisors (see below), whose sum is σ = 5237251992. Its totient is φ = 4433651200.
The previous prime is 4828523893. The next prime is 4828523963. The reversal of 4828523957 is 7593258284.
It can be written as a sum of positive squares in 4 ways, for example, as 484264036 + 4344259921 = 22006^2 + 65911^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4828523957 - 26 = 4828523893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4828523899 and 4828523908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4828523977) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3463094 + ... + 3464487.
It is an arithmetic number, because the mean of its divisors is an integer number (654656499).
Almost surely, 24828523957 is an apocalyptic number.
It is an amenable number.
4828523957 is a deficient number, since it is larger than the sum of its proper divisors (408728035).
4828523957 is a wasteful number, since it uses less digits than its factorization.
4828523957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6927639.
The product of its digits is 4838400, while the sum is 53.
The square root of 4828523957 is about 69487.5813149371. The cubic root of 4828523957 is about 1690.2001276721.
The spelling of 4828523957 in words is "four billion, eight hundred twenty-eight million, five hundred twenty-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •