Base | Representation |
---|---|
bin | 1110110111001100001… |
… | …0010000010000110000 |
3 | 220102001121011102022201 |
4 | 3231303002100100300 |
5 | 13140410224304300 |
6 | 313144241112544 |
7 | 24306251016556 |
oct | 3556302202060 |
9 | 812047142281 |
10 | 255333041200 |
11 | 99316933016 |
12 | 4159a628754 |
13 | 1b101c16883 |
14 | c502c07bd6 |
15 | 699610966a |
hex | 3b73090430 |
255333041200 has 120 divisors (see below), whose sum is σ = 618951669776. Its totient is φ = 101219328000.
The previous prime is 255333041177. The next prime is 255333041263. The reversal of 255333041200 is 2140333552.
255333041200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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, 20334124 + ... + 20346676.
Almost surely, 2255333041200 is an apocalyptic number.
255333041200 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 255333041200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (309475834888).
255333041200 is an abundant number, since it is smaller than the sum of its proper divisors (363618628576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255333041200 is a wasteful number, since it uses less digits than its factorization.
255333041200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13023 (or 13012 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 255333041200 its reverse (2140333552), we get a palindrome (257473374752).
The spelling of 255333041200 in words is "two hundred fifty-five billion, three hundred thirty-three million, forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •