Base | Representation |
---|---|
bin | 1110111000111011001… |
… | …1010110101110010000 |
3 | 220110021001202101002200 |
4 | 3232032303112232100 |
5 | 13142334004210202 |
6 | 313302402043200 |
7 | 24323635516422 |
oct | 3561663265620 |
9 | 813231671080 |
10 | 255798897552 |
11 | 99535899870 |
12 | 416aa649500 |
13 | 1b1775a5913 |
14 | c548a32812 |
15 | 69c1e7ae1c |
hex | 3b8ecd6b90 |
255798897552 has 240 divisors, whose sum is σ = 790186228416. Its totient is φ = 76602240000.
The previous prime is 255798897539. The next prime is 255798897569.
It is a happy number.
255798897552 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (72).
Its product of digits (635040000) is a multiple of the sum of its prime factors (3150).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 109267902 + ... + 109270242.
Almost surely, 2255798897552 is an apocalyptic number.
255798897552 is a gapful number since it is divisible by the number (22) 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 255798897552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (395093114208).
255798897552 is an abundant number, since it is smaller than the sum of its proper divisors (534387330864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255798897552 is a wasteful number, since it uses less digits than its factorization.
255798897552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3150 (or 3141 counting only the distinct ones).
The product of its digits is 635040000, while the sum is 72.
The spelling of 255798897552 in words is "two hundred fifty-five billion, seven hundred ninety-eight million, eight hundred ninety-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •