Base | Representation |
---|---|
bin | 1010011000110100… |
… | …01011001100101001 |
3 | 112101122220201220122 |
4 | 11030122023030221 |
5 | 42410141203241 |
6 | 2321220133025 |
7 | 255125562602 |
oct | 51432131451 |
9 | 15348821818 |
10 | 5576897321 |
11 | 2402016556 |
12 | 10b7837175 |
13 | 6ab528a58 |
14 | 3ac952da9 |
15 | 22990e04b |
hex | 14c68b329 |
5576897321 has 8 divisors (see below), whose sum is σ = 5592774600. Its totient is φ = 5561043840.
The previous prime is 5576897273. The next prime is 5576897357. The reversal of 5576897321 is 1237986755.
It can be written as a sum of positive squares in 4 ways, for example, as 4472265625 + 1104631696 = 66875^2 + 33236^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 5576897321 - 230 = 4503155497 is a prime.
It is a super-2 number, since 2×55768973212 = 62203567457953954082, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5576897371) 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, 529535 + ... + 539963.
It is an arithmetic number, because the mean of its divisors is an integer number (699096825).
Almost surely, 25576897321 is an apocalyptic number.
It is an amenable number.
5576897321 is a deficient number, since it is larger than the sum of its proper divisors (15877279).
5576897321 is a wasteful number, since it uses less digits than its factorization.
5576897321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11899.
The product of its digits is 3175200, while the sum is 53.
The square root of 5576897321 is about 74678.6269356902. The cubic root of 5576897321 is about 1773.3626184187.
The spelling of 5576897321 in words is "five billion, five hundred seventy-six million, eight hundred ninety-seven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •