Base | Representation |
---|---|
bin | 11010111000001101… |
… | …010000001100101111 |
3 | 2202111022201102022222 |
4 | 122320031100030233 |
5 | 433101213120433 |
6 | 21131440025555 |
7 | 2041120244522 |
oct | 327015201457 |
9 | 82438642288 |
10 | 28860285743 |
11 | 1126a973923 |
12 | 57153022bb |
13 | 294c21a973 |
14 | 157ad2cbb9 |
15 | b3da4ab98 |
hex | 6b835032f |
28860285743 has 16 divisors (see below), whose sum is σ = 30289126560. Its totient is φ = 27462758400.
The previous prime is 28860285737. The next prime is 28860285749. The reversal of 28860285743 is 34758206882.
It is an interprime number because it is at equal distance from previous prime (28860285737) and next prime (28860285749).
It is a cyclic number.
It is not a de Polignac number, because 28860285743 - 26 = 28860285679 is a prime.
It is a Smith number, since the sum of its digits (53) 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 (28860285749) 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, 656648 + ... + 699218.
It is an arithmetic number, because the mean of its divisors is an integer number (1893070410).
Almost surely, 228860285743 is an apocalyptic number.
28860285743 is a deficient number, since it is larger than the sum of its proper divisors (1428840817).
28860285743 is a wasteful number, since it uses less digits than its factorization.
28860285743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42938.
The product of its (nonzero) digits is 5160960, while the sum is 53.
The spelling of 28860285743 in words is "twenty-eight billion, eight hundred sixty million, two hundred eighty-five thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •