Base | Representation |
---|---|
bin | 1010111000010011… |
… | …10111000100111001 |
3 | 120002001222101120112 |
4 | 11130021313010321 |
5 | 43430302243212 |
6 | 2403334034105 |
7 | 264514104644 |
oct | 53411670471 |
9 | 16061871515 |
10 | 5841056057 |
11 | 252813a961 |
12 | 11701a8935 |
13 | 721187bb5 |
14 | 3d5a76a5b |
15 | 242bdd422 |
hex | 15c277139 |
5841056057 has 16 divisors (see below), whose sum is σ = 6419487360. Its totient is φ = 5290002432.
The previous prime is 5841056041. The next prime is 5841056093. The reversal of 5841056057 is 7506501485.
5841056057 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 5841056057 - 24 = 5841056041 is a prime.
It is a super-2 number, since 2×58410560572 = 68235871722032774498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5841056957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1167353 + ... + 1172345.
It is an arithmetic number, because the mean of its divisors is an integer number (401217960).
Almost surely, 25841056057 is an apocalyptic number.
It is an amenable number.
5841056057 is a deficient number, since it is larger than the sum of its proper divisors (578431303).
5841056057 is a wasteful number, since it uses less digits than its factorization.
5841056057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7712.
The product of its (nonzero) digits is 168000, while the sum is 41.
The square root of 5841056057 is about 76426.8019545499. The cubic root of 5841056057 is about 1800.9312112715.
The spelling of 5841056057 in words is "five billion, eight hundred forty-one million, fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •