Base | Representation |
---|---|
bin | 11110011110110… |
… | …11100000000001 |
3 | 122211011001122000 |
4 | 33033123200001 |
5 | 1010424444131 |
6 | 41212334213 |
7 | 6223303626 |
oct | 1717334001 |
9 | 584131560 |
10 | 255703041 |
11 | 121379530 |
12 | 71774369 |
13 | 40c8b499 |
14 | 25d6234d |
15 | 176adce6 |
hex | f3db801 |
255703041 has 32 divisors (see below), whose sum is σ = 424444800. Its totient is φ = 150776640.
The previous prime is 255703037. The next prime is 255703051. The reversal of 255703041 is 140307552.
It is a happy number.
255703041 is a `hidden beast` number, since 25 + 570 + 30 + 41 = 666.
255703041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 255703041 - 22 = 255703037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 255702996 and 255703014.
It is not an unprimeable number, because it can be changed into a prime (255703051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 646 + ... + 22623.
It is an arithmetic number, because the mean of its divisors is an integer number (13263900).
Almost surely, 2255703041 is an apocalyptic number.
It is an amenable number.
255703041 is a deficient number, since it is larger than the sum of its proper divisors (168741759).
255703041 is a wasteful number, since it uses less digits than its factorization.
255703041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23326 (or 23320 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 255703041 is about 15990.7173385061. The cubic root of 255703041 is about 634.7148085905.
The spelling of 255703041 in words is "two hundred fifty-five million, seven hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •