Base | Representation |
---|---|
bin | 10000000000111… |
… | …010101111111000 |
3 | 200201120011022020 |
4 | 100000322233320 |
5 | 1022240113323 |
6 | 42354354440 |
7 | 6441465132 |
oct | 2000725770 |
9 | 621504266 |
10 | 268676088 |
11 | 12872a35a |
12 | 75b8ba20 |
13 | 43881345 |
14 | 2797c052 |
15 | 188c2ae3 |
hex | 1003abf8 |
268676088 has 32 divisors (see below), whose sum is σ = 683078400. Its totient is φ = 88040288.
The previous prime is 268676081. The next prime is 268676117. The reversal of 268676088 is 880676862.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 268676088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268676081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93456 + ... + 96287.
It is an arithmetic number, because the mean of its divisors is an integer number (21346200).
Almost surely, 2268676088 is an apocalyptic number.
It is an amenable number.
268676088 is an abundant number, since it is smaller than the sum of its proper divisors (414402312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268676088 is a wasteful number, since it uses less digits than its factorization.
268676088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189811 (or 189807 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 51.
The square root of 268676088 is about 16391.3418608728. The cubic root of 268676088 is about 645.2722749284.
The spelling of 268676088 in words is "two hundred sixty-eight million, six hundred seventy-six thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •