Base | Representation |
---|---|
bin | 1110110110110000000… |
… | …1111010101111101000 |
3 | 220101202102000100022211 |
4 | 3231230001322233220 |
5 | 13140140132400202 |
6 | 313124442054504 |
7 | 24303323030500 |
oct | 3555401725750 |
9 | 811672010284 |
10 | 255215512552 |
11 | 9926655a000 |
12 | 415671aa434 |
13 | 1b0b37767b0 |
14 | c4d1372a00 |
15 | 698ab411d7 |
hex | 3b6c07abe8 |
255215512552 has 384 divisors, whose sum is σ = 666195425280. Its totient is φ = 90841766400.
The previous prime is 255215512529. The next prime is 255215512577.
255215512552 is nontrivially palindromic in base 10.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1295510118 + ... + 1295510314.
It is an arithmetic number, because the mean of its divisors is an integer number (1734883920).
Almost surely, 2255215512552 is an apocalyptic number.
255215512552 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 255215512552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (333097712640).
255215512552 is an abundant number, since it is smaller than the sum of its proper divisors (410979912728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255215512552 is a wasteful number, since it uses less digits than its factorization.
255215512552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454 (or 421 counting only the distinct ones).
The product of its digits is 250000, while the sum is 40.
It can be divided in two parts, 255215 and 512552, that added together give a palindrome (767767).
The spelling of 255215512552 in words is "two hundred fifty-five billion, two hundred fifteen million, five hundred twelve thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •