Base | Representation |
---|---|
bin | 11010111111000111… |
… | …111000000100000111 |
3 | 2202210102001101212001 |
4 | 122333013320010013 |
5 | 433320414113204 |
6 | 21151143010131 |
7 | 2044026425242 |
oct | 327707700407 |
9 | 82712041761 |
10 | 28976316679 |
11 | 1131a414662 |
12 | 5748139947 |
13 | 296a28511b |
14 | 158c4d4259 |
15 | b48d1a4a4 |
hex | 6bf1f8107 |
28976316679 has 2 divisors, whose sum is σ = 28976316680. Its totient is φ = 28976316678.
The previous prime is 28976316661. The next prime is 28976316697. The reversal of 28976316679 is 97661367982.
It is a happy number.
Together with next prime (28976316697) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (28976316661) and next prime (28976316697).
It is a cyclic number.
It is not a de Polignac number, because 28976316679 - 217 = 28976185607 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 28976316679.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28976316659) 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 as a sum of consecutive naturals, namely, 14488158339 + 14488158340.
It is an arithmetic number, because the mean of its divisors is an integer number (14488158340).
Almost surely, 228976316679 is an apocalyptic number.
28976316679 is a deficient number, since it is larger than the sum of its proper divisors (1).
28976316679 is an equidigital number, since it uses as much as digits as its factorization.
28976316679 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41150592, while the sum is 64.
The spelling of 28976316679 in words is "twenty-eight billion, nine hundred seventy-six million, three hundred sixteen thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •