Base | Representation |
---|---|
bin | 11111011000010101100 |
3 | 1221020112000 |
4 | 3323002230 |
5 | 230401033 |
6 | 34012300 |
7 | 11511603 |
oct | 3730254 |
9 | 1836460 |
10 | 1028268 |
11 | 64260a |
12 | 417090 |
13 | 2a0057 |
14 | 1caa3a |
15 | 154a13 |
hex | fb0ac |
1028268 has 24 divisors (see below), whose sum is σ = 2666160. Its totient is φ = 342720.
The previous prime is 1028263. The next prime is 1028273. The reversal of 1028268 is 8628201.
It is an interprime number because it is at equal distance from previous prime (1028263) and next prime (1028273).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1028263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4653 + ... + 4868.
It is an arithmetic number, because the mean of its divisors is an integer number (111090).
21028268 is an apocalyptic number.
1028268 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1028268 is an abundant number, since it is smaller than the sum of its proper divisors (1637892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1028268 is a wasteful number, since it uses less digits than its factorization.
1028268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9534 (or 9526 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 1028268 is about 1014.0355023371. The cubic root of 1028268 is about 100.9335248621.
It can be divided in two parts, 1028 and 268, that added together give a 4-th power (1296 = 64).
The spelling of 1028268 in words is "one million, twenty-eight thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •