Base | Representation |
---|---|
bin | 11111111111110… |
… | …00010101010000 |
3 | 200201001100010200 |
4 | 33333320111100 |
5 | 1022202412143 |
6 | 42344455200 |
7 | 6436253043 |
oct | 1777702520 |
9 | 621040120 |
10 | 268404048 |
11 | 128563a30 |
12 | 75a7a500 |
13 | 437b7583 |
14 | 2790ac5a |
15 | 1886c1d3 |
hex | fff8550 |
268404048 has 120 divisors (see below), whose sum is σ = 847847520. Its totient is φ = 78516480.
The previous prime is 268403977. The next prime is 268404067. The reversal of 268404048 is 840404862.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 16.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 43015 + ... + 48857.
It is an arithmetic number, because the mean of its divisors is an integer number (7065396).
Almost surely, 2268404048 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 268404048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (423923760).
268404048 is an abundant number, since it is smaller than the sum of its proper divisors (579443472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268404048 is a wasteful number, since it uses less digits than its factorization.
268404048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5897 (or 5888 counting only the distinct ones).
The product of its (nonzero) digits is 49152, while the sum is 36.
The square root of 268404048 is about 16383.0414758677. The cubic root of 268404048 is about 645.0544176189.
The spelling of 268404048 in words is "two hundred sixty-eight million, four hundred four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.953 sec. • engine limits •