Base | Representation |
---|---|
bin | 10011101100000001000… |
… | …11100010010011100101 |
3 | 2101200002010101002121222 |
4 | 21312000203202103211 |
5 | 42040400431232202 |
6 | 1234433044150125 |
7 | 66605321530316 |
oct | 11660043422345 |
9 | 2350063332558 |
10 | 676466664677 |
11 | 240984884541 |
12 | ab12b398345 |
13 | 4ba37a5385b |
14 | 24a53a6460d |
15 | 128e30474a2 |
hex | 9d808e24e5 |
676466664677 has 16 divisors (see below), whose sum is σ = 707966347200. Its totient is φ = 645530135040.
The previous prime is 676466664617. The next prime is 676466664683. The reversal of 676466664677 is 776466664676.
It is a cyclic number.
It is not a de Polignac number, because 676466664677 - 28 = 676466664421 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 676466664677.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (676466664617) 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 15 ways as a sum of consecutive naturals, for example, 1916102 + ... + 2241512.
It is an arithmetic number, because the mean of its divisors is an integer number (44247896700).
Almost surely, 2676466664677 is an apocalyptic number.
It is an amenable number.
676466664677 is a deficient number, since it is larger than the sum of its proper divisors (31499682523).
676466664677 is a wasteful number, since it uses less digits than its factorization.
676466664677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326276.
The product of its digits is 1536288768, while the sum is 71.
Subtracting 676466664677 from its reverse (776466664676), we obtain a palindrome (99999999999).
The spelling of 676466664677 in words is "six hundred seventy-six billion, four hundred sixty-six million, six hundred sixty-four thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •