Base | Representation |
---|---|
bin | 11111111110010… |
… | …01001110110101 |
3 | 200200200112111101 |
4 | 33333021032311 |
5 | 1022130224000 |
6 | 42340410101 |
7 | 6434520430 |
oct | 1777111665 |
9 | 620615441 |
10 | 268211125 |
11 | 128441a96 |
12 | 759a6931 |
13 | 4374a810 |
14 | 2789a817 |
15 | 1882ee6a |
hex | ffc93b5 |
268211125 has 128 divisors (see below), whose sum is σ = 465454080. Its totient is φ = 149299200.
The previous prime is 268211089. The next prime is 268211129. The reversal of 268211125 is 521112862.
It is not a de Polignac number, because 268211125 - 211 = 268209077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 268211093 and 268211102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268211129) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 3674089 + ... + 3674161.
It is an arithmetic number, because the mean of its divisors is an integer number (3636360).
Almost surely, 2268211125 is an apocalyptic number.
268211125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
268211125 is a deficient number, since it is larger than the sum of its proper divisors (197242955).
268211125 is a wasteful number, since it uses less digits than its factorization.
268211125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 134 counting only the distinct ones).
The product of its digits is 1920, while the sum is 28.
The square root of 268211125 is about 16377.1525302783. The cubic root of 268211125 is about 644.8998302067.
Adding to 268211125 its reverse (521112862), we get a palindrome (789323987).
The spelling of 268211125 in words is "two hundred sixty-eight million, two hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •