Base | Representation |
---|---|
bin | 10001001101111… |
… | …111000111010110 |
3 | 202010120120120112 |
4 | 101031333013112 |
5 | 1042423112222 |
6 | 44355403022 |
7 | 10105301003 |
oct | 2115770726 |
9 | 663516515 |
10 | 288879062 |
11 | 13907912a |
12 | 808b3472 |
13 | 47b05c74 |
14 | 2a51a8aa |
15 | 1a563be2 |
hex | 1137f1d6 |
288879062 has 8 divisors (see below), whose sum is σ = 458807976. Its totient is φ = 135943072.
The previous prime is 288879037. The next prime is 288879067. The reversal of 288879062 is 260978882.
288879062 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2888790622 = 166902224923999688, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 288879062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (288879067) 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 3 ways as a sum of consecutive naturals, for example, 4248188 + ... + 4248255.
It is an arithmetic number, because the mean of its divisors is an integer number (57350997).
Almost surely, 2288879062 is an apocalyptic number.
288879062 is a deficient number, since it is larger than the sum of its proper divisors (169928914).
288879062 is a wasteful number, since it uses less digits than its factorization.
288879062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8496462.
The product of its (nonzero) digits is 774144, while the sum is 50.
The square root of 288879062 is about 16996.4426277971. The cubic root of 288879062 is about 661.0566651885.
The spelling of 288879062 in words is "two hundred eighty-eight million, eight hundred seventy-nine thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •