Base | Representation |
---|---|
bin | 111010000100101001111101… |
… | …001110101000000100001101 |
3 | 1020111022122010220212011111201 |
4 | 322010221331032220010031 |
5 | 231434040232302210221 |
6 | 2303112103450145501 |
7 | 104540343202411564 |
oct | 7204517516500415 |
9 | 1214278126764451 |
10 | 255406626210061 |
11 | 74420384070a57 |
12 | 2478b622422291 |
13 | ac689841249b1 |
14 | 470da64bd2bdb |
15 | 1e7daa48ea891 |
hex | e84a7d3a810d |
255406626210061 has 8 divisors (see below), whose sum is σ = 263663582082048. Its totient is φ = 247150797366000.
The previous prime is 255406626210031. The next prime is 255406626210067. The reversal of 255406626210061 is 160012626604552.
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 255406626210061 - 213 = 255406626201869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 255406626209993 and 255406626210020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255406626210067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281296405 + ... + 282202906.
It is an arithmetic number, because the mean of its divisors is an integer number (32957947760256).
Almost surely, 2255406626210061 is an apocalyptic number.
It is an amenable number.
255406626210061 is a deficient number, since it is larger than the sum of its proper divisors (8256955871987).
255406626210061 is a wasteful number, since it uses less digits than its factorization.
255406626210061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563513963.
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 255406626210061 in words is "two hundred fifty-five trillion, four hundred six billion, six hundred twenty-six million, two hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •