Base | Representation |
---|---|
bin | 111100011101011… |
… | …1011100011100000 |
3 | 12020101101100201021 |
4 | 1320322323203200 |
5 | 13123322323313 |
6 | 533150215224 |
7 | 101162533453 |
oct | 17072734340 |
9 | 5211340637 |
10 | 2028714208 |
11 | 95117a014 |
12 | 4874b4514 |
13 | 2643bc011 |
14 | 15361149a |
15 | bd18578d |
hex | 78ebb8e0 |
2028714208 has 48 divisors (see below), whose sum is σ = 4236503040. Its totient is φ = 953596800.
The previous prime is 2028714203. The next prime is 2028714257. The reversal of 2028714208 is 8024178202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2028714203) 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, 66913 + ... + 92383.
It is an arithmetic number, because the mean of its divisors is an integer number (88260480).
Almost surely, 22028714208 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2028714208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2118251520).
2028714208 is an abundant number, since it is smaller than the sum of its proper divisors (2207788832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2028714208 is a wasteful number, since it uses less digits than its factorization.
2028714208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25631 (or 25623 counting only the distinct ones).
The product of its (nonzero) digits is 14336, while the sum is 34.
The square root of 2028714208 is about 45041.2500714623. The cubic root of 2028714208 is about 1265.9220278300.
The spelling of 2028714208 in words is "two billion, twenty-eight million, seven hundred fourteen thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •