Base | Representation |
---|---|
bin | 1010100100010100… |
… | …00101111001000001 |
3 | 112122101101202200020 |
4 | 11102022011321001 |
5 | 43104334011302 |
6 | 2334543244053 |
7 | 260406430125 |
oct | 52212057101 |
9 | 15571352606 |
10 | 5673344577 |
11 | 245150082a |
12 | 1123ba9629 |
13 | 6c54c7434 |
14 | 3bb69b585 |
15 | 233110ebc |
hex | 152285e41 |
5673344577 has 32 divisors (see below), whose sum is σ = 8090248320. Its totient is φ = 3525949440.
The previous prime is 5673344563. The next prime is 5673344587. The reversal of 5673344577 is 7754433765.
5673344577 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5673344577 - 26 = 5673344513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5673344507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2166573 + ... + 2169189.
It is an arithmetic number, because the mean of its divisors is an integer number (252820260).
Almost surely, 25673344577 is an apocalyptic number.
5673344577 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
5673344577 is a deficient number, since it is larger than the sum of its proper divisors (2416903743).
5673344577 is a wasteful number, since it uses less digits than its factorization.
5673344577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3233.
The product of its digits is 7408800, while the sum is 51.
The square root of 5673344577 is about 75321.6076368528. The cubic root of 5673344577 is about 1783.5271325144.
The spelling of 5673344577 in words is "five billion, six hundred seventy-three million, three hundred forty-four thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •