Base | Representation |
---|---|
bin | 111010000000100001000001… |
… | …001100000000101111100101 |
3 | 1020110022102212100122201210022 |
4 | 322000201001030000233211 |
5 | 231414410131132101323 |
6 | 2302333255340204525 |
7 | 104510652506430656 |
oct | 7200410114005745 |
9 | 1213272770581708 |
10 | 255122151050213 |
11 | 74320773279967 |
12 | 24744470239745 |
13 | ac47bb97b3745 |
14 | 46ddd9989552d |
15 | 1e764a51744c8 |
hex | e80841300be5 |
255122151050213 has 8 divisors (see below), whose sum is σ = 255834678628800. Its totient is φ = 254409633921888.
The previous prime is 255122151050183. The next prime is 255122151050227. The reversal of 255122151050213 is 312050151221552.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 255122151050213 - 28 = 255122151049957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255122151050243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47628818 + ... + 52713836.
It is an arithmetic number, because the mean of its divisors is an integer number (31979334828600).
Almost surely, 2255122151050213 is an apocalyptic number.
It is an amenable number.
255122151050213 is a deficient number, since it is larger than the sum of its proper divisors (712527578587).
255122151050213 is a wasteful number, since it uses less digits than its factorization.
255122151050213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5225131.
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 255122151050213 in words is "two hundred fifty-five trillion, one hundred twenty-two billion, one hundred fifty-one million, fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •