Base | Representation |
---|---|
bin | 100011110011011011… |
… | …1100100000110101001 |
3 | 21100110102220101101011 |
4 | 1013212313210012221 |
5 | 2224431232111023 |
6 | 55153255423521 |
7 | 5361231154222 |
oct | 1074667440651 |
9 | 240412811334 |
10 | 76887769513 |
11 | 2a676161275 |
12 | 12a99684ba1 |
13 | 7334416c09 |
14 | 3a156ba249 |
15 | 200015b50d |
hex | 11e6de41a9 |
76887769513 has 8 divisors (see below), whose sum is σ = 79577209800. Its totient is φ = 74200871808.
The previous prime is 76887769489. The next prime is 76887769531. The reversal of 76887769513 is 31596778867.
It can be written as a sum of positive squares in 4 ways, for example, as 16119603369 + 60768166144 = 126963^2 + 246512^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 76887769513 - 25 = 76887769481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76887769583) 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 7 ways as a sum of consecutive naturals, for example, 574006 + ... + 695167.
It is an arithmetic number, because the mean of its divisors is an integer number (9947151225).
Almost surely, 276887769513 is an apocalyptic number.
It is an amenable number.
76887769513 is a deficient number, since it is larger than the sum of its proper divisors (2689440287).
76887769513 is a wasteful number, since it uses less digits than its factorization.
76887769513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271291.
The product of its digits is 106686720, while the sum is 67.
It can be divided in two parts, 76887 and 769513, that added together give a square (846400 = 9202).
The spelling of 76887769513 in words is "seventy-six billion, eight hundred eighty-seven million, seven hundred sixty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •