Base | Representation |
---|---|
bin | 1110110101111111100… |
… | …0001001010110000101 |
3 | 220101020012100202021000 |
4 | 3231133320021112011 |
5 | 13134230433434300 |
6 | 313052320043513 |
7 | 24265266020253 |
oct | 3553770112605 |
9 | 811205322230 |
10 | 255011624325 |
11 | 99171460837 |
12 | 4150aa63599 |
13 | 1b08045a783 |
14 | c4b225b5d3 |
15 | 6977cb9c00 |
hex | 3b5fe09585 |
255011624325 has 48 divisors (see below), whose sum is σ = 468589383360. Its totient is φ = 135970320960.
The previous prime is 255011624297. The next prime is 255011624377. The reversal of 255011624325 is 523426110552.
255011624325 is a `hidden beast` number, since 2 + 5 + 5 + 0 + 1 + 1 + 624 + 3 + 25 = 666.
It is not a de Polignac number, because 255011624325 - 212 = 255011620229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 255011624325.
It is a congruent number.
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, 2616367 + ... + 2712083.
It is an arithmetic number, because the mean of its divisors is an integer number (9762278820).
Almost surely, 2255011624325 is an apocalyptic number.
255011624325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
255011624325 is a deficient number, since it is larger than the sum of its proper divisors (213577759035).
255011624325 is a wasteful number, since it uses less digits than its factorization.
255011624325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99683 (or 99672 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
Adding to 255011624325 its reverse (523426110552), we get a palindrome (778437734877).
The spelling of 255011624325 in words is "two hundred fifty-five billion, eleven million, six hundred twenty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •