Base | Representation |
---|---|
bin | 111100011100111… |
… | …0111010101010101 |
3 | 12020100212011101211 |
4 | 1320321313111111 |
5 | 13123234403043 |
6 | 533140221421 |
7 | 101160261001 |
oct | 17071672525 |
9 | 5210764354 |
10 | 2028434773 |
11 | 950aa9082 |
12 | 48739a871 |
13 | 264321a81 |
14 | 15357b701 |
15 | bd12ca9d |
hex | 78e77555 |
2028434773 has 2 divisors, whose sum is σ = 2028434774. Its totient is φ = 2028434772.
The previous prime is 2028434761. The next prime is 2028434797. The reversal of 2028434773 is 3774348202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1956558289 + 71876484 = 44233^2 + 8478^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2028434773 is a prime.
It is a super-3 number, since 3×20284347733 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2028434753) 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, 1014217386 + 1014217387.
It is an arithmetic number, because the mean of its divisors is an integer number (1014217387).
Almost surely, 22028434773 is an apocalyptic number.
It is an amenable number.
2028434773 is a deficient number, since it is larger than the sum of its proper divisors (1).
2028434773 is an equidigital number, since it uses as much as digits as its factorization.
2028434773 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225792, while the sum is 40.
The square root of 2028434773 is about 45038.1479748002. The cubic root of 2028434773 is about 1265.8639024809.
The spelling of 2028434773 in words is "two billion, twenty-eight million, four hundred thirty-four thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •