Base | Representation |
---|---|
bin | 100011100000010100111… |
… | …1100110110000010001101 |
3 | 122021111120201111221001021 |
4 | 1013000221330312002031 |
5 | 1114422300341222302 |
6 | 14213424255314141 |
7 | 1012360443160123 |
oct | 107005174660215 |
9 | 18244521457037 |
10 | 4879786664077 |
11 | 16115623a0a66 |
12 | 66989a81b951 |
13 | 295214933830 |
14 | 12c27bd89913 |
15 | 86e03b7a437 |
hex | 47029f3608d |
4879786664077 has 18 divisors (see below), whose sum is σ = 5280363729998. Its totient is φ = 4482913636848.
The previous prime is 4879786664033. The next prime is 4879786664141. The reversal of 4879786664077 is 7704666879784.
It can be written as a sum of positive squares in only one way, i.e., 3378313844361 + 1501472819716 = 1838019^2 + 1225346^2 .
It is a de Polignac number, because none of the positive numbers 2k-4879786664077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4879786663988 and 4879786664006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4879786694077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1807996674 + ... + 1807999372.
Almost surely, 24879786664077 is an apocalyptic number.
It is an amenable number.
4879786664077 is a deficient number, since it is larger than the sum of its proper divisors (400577065921).
4879786664077 is an frugal number, since it uses more digits than its factorization.
4879786664077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5865 (or 2939 counting only the distinct ones).
The product of its (nonzero) digits is 4779565056, while the sum is 79.
The spelling of 4879786664077 in words is "four trillion, eight hundred seventy-nine billion, seven hundred eighty-six million, six hundred sixty-four thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •