Base | Representation |
---|---|
bin | 11110011011010… |
… | …00101000000000 |
3 | 122210021011012000 |
4 | 33031220220000 |
5 | 1010314420022 |
6 | 41154304000 |
7 | 6216304053 |
oct | 1715505000 |
9 | 583234160 |
10 | 255232512 |
11 | 121087a67 |
12 | 71588000 |
13 | 40b55272 |
14 | 25c7ca9a |
15 | 176196ac |
hex | f368a00 |
255232512 has 160 divisors (see below), whose sum is σ = 777480000. Its totient is φ = 82612224.
The previous prime is 255232501. The next prime is 255232519. The reversal of 255232512 is 215232552.
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 (255232519) 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 15 ways as a sum of consecutive naturals, for example, 511239 + ... + 511737.
It is an arithmetic number, because the mean of its divisors is an integer number (4859250).
Almost surely, 2255232512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255232512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (388740000).
255232512 is an abundant number, since it is smaller than the sum of its proper divisors (522247488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255232512 is an equidigital number, since it uses as much as digits as its factorization.
255232512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563 (or 541 counting only the distinct ones).
The product of its digits is 6000, while the sum is 27.
The square root of 255232512 is about 15975.9979969954. The cubic root of 255232512 is about 634.3252485011.
The spelling of 255232512 in words is "two hundred fifty-five million, two hundred thirty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •