Base | Representation |
---|---|
bin | 11110011010100… |
… | …00011000010000 |
3 | 122210002002221210 |
4 | 33031100120100 |
5 | 1010303230300 |
6 | 41152220120 |
7 | 6215411400 |
oct | 1715203020 |
9 | 583062853 |
10 | 255133200 |
11 | 12101a393 |
12 | 7153a640 |
13 | 40b1bcba |
14 | 25c54800 |
15 | 175ea050 |
hex | f350610 |
255133200 has 180 divisors, whose sum is σ = 950928720. Its totient is φ = 58302720.
The previous prime is 255133199. The next prime is 255133231. The reversal of 255133200 is 2331552.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 56631 + ... + 60969.
Almost surely, 2255133200 is an apocalyptic number.
255133200 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 255133200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (475464360).
255133200 is an abundant number, since it is smaller than the sum of its proper divisors (695795520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255133200 is a wasteful number, since it uses less digits than its factorization.
255133200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4374 (or 4356 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 255133200 is about 15972.8895319538. The cubic root of 255133200 is about 634.2429649902.
Adding to 255133200 its reverse (2331552), we get a palindrome (257464752).
The spelling of 255133200 in words is "two hundred fifty-five million, one hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •