Base | Representation |
---|---|
bin | 100100001110000001100… |
… | …1000100100100100110111 |
3 | 122121212212210002101022111 |
4 | 1020130003020210210313 |
5 | 1123024234414042204 |
6 | 14330454050311451 |
7 | 1022433330043630 |
oct | 110340310444467 |
9 | 18555783071274 |
10 | 4977919674679 |
11 | 164a13a978316 |
12 | 684907288587 |
13 | 2a15536c9b03 |
14 | 132d0b096887 |
15 | 89749027d04 |
hex | 48703224937 |
4977919674679 has 4 divisors (see below), whose sum is σ = 5689051056784. Its totient is φ = 4266788292576.
The previous prime is 4977919674601. The next prime is 4977919674797. The reversal of 4977919674679 is 9764769197794.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4977919674679 - 215 = 4977919641911 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4977919674596 and 4977919674605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4977919672679) 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 3 ways as a sum of consecutive naturals, for example, 355565691042 + ... + 355565691055.
It is an arithmetic number, because the mean of its divisors is an integer number (1422262764196).
Almost surely, 24977919674679 is an apocalyptic number.
4977919674679 is a deficient number, since it is larger than the sum of its proper divisors (711131382105).
4977919674679 is an equidigital number, since it uses as much as digits as its factorization.
4977919674679 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711131382104.
The product of its digits is 9073705536, while the sum is 85.
The spelling of 4977919674679 in words is "four trillion, nine hundred seventy-seven billion, nine hundred nineteen million, six hundred seventy-four thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •