Base | Representation |
---|---|
bin | 11111111101111… |
… | …11001010011000 |
3 | 200200121102220210 |
4 | 33332333022120 |
5 | 1022122414010 |
6 | 42335451120 |
7 | 6434256246 |
oct | 1776771230 |
9 | 620542823 |
10 | 268169880 |
11 | 128414000 |
12 | 75986aa0 |
13 | 43734b04 |
14 | 27889796 |
15 | 18822b20 |
hex | ffbf298 |
268169880 has 256 divisors, whose sum is σ = 936023040. Its totient is φ = 61332480.
The previous prime is 268169851. The next prime is 268169893. The reversal of 268169880 is 88961862.
It is a congruent number.
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 3673524 + ... + 3673596.
It is an arithmetic number, because the mean of its divisors is an integer number (3656340).
Almost surely, 2268169880 is an apocalyptic number.
268169880 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 268169880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (468011520).
268169880 is an abundant number, since it is smaller than the sum of its proper divisors (667853160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268169880 is a wasteful number, since it uses less digits than its factorization.
268169880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 48.
The square root of 268169880 is about 16375.8932580791. The cubic root of 268169880 is about 644.8667713530.
The spelling of 268169880 in words is "two hundred sixty-eight million, one hundred sixty-nine thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •