Base | Representation |
---|---|
bin | 11110011110010… |
… | …01001011010100 |
3 | 122211000020200021 |
4 | 33033021023110 |
5 | 1010420043423 |
6 | 41210554524 |
7 | 6222542050 |
oct | 1717111324 |
9 | 584006607 |
10 | 255627988 |
11 | 121328100 |
12 | 71738a44 |
13 | 40c63285 |
14 | 25d42c60 |
15 | 1769695d |
hex | f3c92d4 |
255627988 has 72 divisors (see below), whose sum is σ = 566286336. Its totient is φ = 98831040.
The previous prime is 255627961. The next prime is 255628001. The reversal of 255627988 is 889726552.
Its product of digits (2419200) is a multiple of the sum of its prime divisors (600).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 667245 + ... + 667627.
It is an arithmetic number, because the mean of its divisors is an integer number (7865088).
Almost surely, 2255627988 is an apocalyptic number.
255627988 is a gapful number since it is divisible by the number (28) 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 255627988, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (283143168).
255627988 is an abundant number, since it is smaller than the sum of its proper divisors (310658348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255627988 is a wasteful number, since it uses less digits than its factorization.
255627988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613 (or 600 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 52.
The square root of 255627988 is about 15988.3703985115. The cubic root of 255627988 is about 634.6527028083.
The spelling of 255627988 in words is "two hundred fifty-five million, six hundred twenty-seven thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •