Base | Representation |
---|---|
bin | 11110011010000… |
… | …00000001011000 |
3 | 122202221201001022 |
4 | 33031000001120 |
5 | 1010244104300 |
6 | 41150542012 |
7 | 6215012144 |
oct | 1715000130 |
9 | 582851038 |
10 | 255066200 |
11 | 120a84014 |
12 | 71507908 |
13 | 40ac765c |
14 | 25c38224 |
15 | 175d5285 |
hex | f340058 |
255066200 has 48 divisors (see below), whose sum is σ = 595508760. Its totient is φ = 101600000.
The previous prime is 255066179. The next prime is 255066209. The reversal of 255066200 is 2660552.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 255066200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255066209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47660 + ... + 52740.
Almost surely, 2255066200 is an apocalyptic number.
255066200 is a gapful number since it is divisible by the number (20) 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 255066200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (297754380).
255066200 is an abundant number, since it is smaller than the sum of its proper divisors (340442560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255066200 is a wasteful number, since it uses less digits than its factorization.
255066200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5348 (or 5339 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 255066200 is about 15970.7920905633. The cubic root of 255066200 is about 634.1874410535.
The spelling of 255066200 in words is "two hundred fifty-five million, sixty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •