Base | Representation |
---|---|
bin | 1001001101000101… |
… | …00000010010110101 |
3 | 110202101101120200022 |
4 | 10212202200102311 |
5 | 40110013443202 |
6 | 2134202254525 |
7 | 233312311424 |
oct | 44642402265 |
9 | 13671346608 |
10 | 4941546677 |
11 | 2106413181 |
12 | b5aab7445 |
13 | 609a03922 |
14 | 34c4072bb |
15 | 1ddc5bea2 |
hex | 1268a04b5 |
4941546677 has 8 divisors (see below), whose sum is σ = 5047795200. Its totient is φ = 4835344464.
The previous prime is 4941546667. The next prime is 4941546691. The reversal of 4941546677 is 7766451494.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4941546677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4941546667) 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 7 ways as a sum of consecutive naturals, for example, 284324 + ... + 301202.
It is an arithmetic number, because the mean of its divisors is an integer number (630974400).
Almost surely, 24941546677 is an apocalyptic number.
4941546677 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
It is an amenable number.
4941546677 is a deficient number, since it is larger than the sum of its proper divisors (106248523).
4941546677 is a wasteful number, since it uses less digits than its factorization.
4941546677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23155.
The product of its digits is 5080320, while the sum is 53.
The square root of 4941546677 is about 70296.1355765735. The cubic root of 4941546677 is about 1703.2862243635.
The spelling of 4941546677 in words is "four billion, nine hundred forty-one million, five hundred forty-six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •