Base | Representation |
---|---|
bin | 11110011111101… |
… | …10110101110100 |
3 | 122211100202020200 |
4 | 33033312311310 |
5 | 1010442040103 |
6 | 41215000500 |
7 | 6224251260 |
oct | 1717666564 |
9 | 584322220 |
10 | 255815028 |
11 | 121445687 |
12 | 71809130 |
13 | 40cca451 |
14 | 25d910a0 |
15 | 176d20a3 |
hex | f3f6d74 |
255815028 has 36 divisors (see below), whose sum is σ = 739021920. Its totient is φ = 73089936.
The previous prime is 255815017. The next prime is 255815033. The reversal of 255815028 is 820518552.
255815028 is a `hidden beast` number, since 2 + 5 + 581 + 50 + 28 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 255814983 and 255815001.
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 11 ways as a sum of consecutive naturals, for example, 507318 + ... + 507821.
Almost surely, 2255815028 is an apocalyptic number.
255815028 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
255815028 is an abundant number, since it is smaller than the sum of its proper divisors (483206892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255815028 is a wasteful number, since it uses less digits than its factorization.
255815028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015156 (or 1015151 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 36.
The square root of 255815028 is about 15994.2185804746. The cubic root of 255815028 is about 634.8074543836.
The spelling of 255815028 in words is "two hundred fifty-five million, eight hundred fifteen thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •