Base | Representation |
---|---|
bin | 111001111111011111001110… |
… | …001011110111000101000100 |
3 | 1020110001200111201021221201120 |
4 | 321333133032023313011010 |
5 | 231412230434022412202 |
6 | 2302241013105153540 |
7 | 104502601662632532 |
oct | 7177371613670504 |
9 | 1213050451257646 |
10 | 255051502154052 |
11 | 742a380987257a |
12 | 2473283402b8b0 |
13 | ac4133aab0686 |
14 | 46da7b6a09152 |
15 | 1e7471cad80bc |
hex | e7f7ce2f7144 |
255051502154052 has 48 divisors (see below), whose sum is σ = 601344318677760. Its totient is φ = 84129755584032.
The previous prime is 255051502154011. The next prime is 255051502154083. The reversal of 255051502154052 is 250451205150552.
It is a junction number, because it is equal to n+sod(n) for n = 255051502153995 and 255051502154013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108338302 + ... + 110667477.
It is an arithmetic number, because the mean of its divisors is an integer number (12528006639120).
Almost surely, 2255051502154052 is an apocalyptic number.
It is an amenable number.
255051502154052 is an abundant number, since it is smaller than the sum of its proper divisors (346292816523708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255051502154052 is a wasteful number, since it uses less digits than its factorization.
255051502154052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219006800 (or 219006798 counting only the distinct ones).
The product of its (nonzero) digits is 500000, while the sum is 42.
The spelling of 255051502154052 in words is "two hundred fifty-five trillion, fifty-one billion, five hundred two million, one hundred fifty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •