Base | Representation |
---|---|
bin | 11010001001100000… |
… | …001001111000111111 |
3 | 2200110201021201112020 |
4 | 122021200021320333 |
5 | 430000114231422 |
6 | 20522005211223 |
7 | 2012524052466 |
oct | 321140117077 |
9 | 80421251466 |
10 | 28076711487 |
11 | 109a86319a0 |
12 | 5536a00b13 |
13 | 2855a99366 |
14 | 1504c3b9dd |
15 | ae4d6a95c |
hex | 689809e3f |
28076711487 has 8 divisors (see below), whose sum is σ = 40838853120. Its totient is φ = 17016188760.
The previous prime is 28076711461. The next prime is 28076711489. The reversal of 28076711487 is 78411767082.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28076711487 - 27 = 28076711359 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28076711489) 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 7 ways as a sum of consecutive naturals, for example, 425404687 + ... + 425404752.
It is an arithmetic number, because the mean of its divisors is an integer number (5104856640).
Almost surely, 228076711487 is an apocalyptic number.
28076711487 is a deficient number, since it is larger than the sum of its proper divisors (12762141633).
28076711487 is a wasteful number, since it uses less digits than its factorization.
28076711487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 850809453.
The product of its (nonzero) digits is 1053696, while the sum is 51.
It can be divided in two parts, 280 and 76711487, that added together give a palindrome (76711767).
The spelling of 28076711487 in words is "twenty-eight billion, seventy-six million, seven hundred eleven thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •