Base | Representation |
---|---|
bin | 1001111111010110… |
… | …11011000101110001 |
3 | 111211210000122010102 |
4 | 10333223123011301 |
5 | 41441002040212 |
6 | 2244110242145 |
7 | 246623266022 |
oct | 47753330561 |
9 | 14753018112 |
10 | 5363315057 |
11 | 23024a6a91 |
12 | 10581b6355 |
13 | 6761c7509 |
14 | 38c436c49 |
15 | 215cc05c2 |
hex | 13fadb171 |
5363315057 has 8 divisors (see below), whose sum is σ = 5832286056. Its totient is φ = 4911397632.
The previous prime is 5363314997. The next prime is 5363315077. The reversal of 5363315057 is 7505133635.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1944457216 + 3418857841 = 44096^2 + 58471^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 5363315057 - 26 = 5363314993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5363315057.
It is not an unprimeable number, because it can be changed into a prime (5363315077) 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, 4262738 + ... + 4263995.
It is an arithmetic number, because the mean of its divisors is an integer number (729035757).
Almost surely, 25363315057 is an apocalyptic number.
It is an amenable number.
5363315057 is a deficient number, since it is larger than the sum of its proper divisors (468970999).
5363315057 is a wasteful number, since it uses less digits than its factorization.
5363315057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8526787.
The product of its (nonzero) digits is 141750, while the sum is 38.
The square root of 5363315057 is about 73234.6574853737. The cubic root of 5363315057 is about 1750.4287446918.
The spelling of 5363315057 in words is "five billion, three hundred sixty-three million, three hundred fifteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •