Base | Representation |
---|---|
bin | 11110011101010… |
… | …11001010011101 |
3 | 122210210000001010 |
4 | 33032223022131 |
5 | 1010402130203 |
6 | 41204205433 |
7 | 6221520456 |
oct | 1716531235 |
9 | 583700033 |
10 | 255505053 |
11 | 121253801 |
12 | 71699879 |
13 | 40c1c32b |
14 | 25d1012d |
15 | 17670303 |
hex | f3ab29d |
255505053 has 16 divisors (see below), whose sum is σ = 364291776. Its totient is φ = 158726400.
The previous prime is 255505049. The next prime is 255505057. The reversal of 255505053 is 350505552.
It is an interprime number because it is at equal distance from previous prime (255505049) and next prime (255505057).
It is not a de Polignac number, because 255505053 - 22 = 255505049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 255505053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255505057) 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 15 ways as a sum of consecutive naturals, for example, 19651 + ... + 29952.
It is an arithmetic number, because the mean of its divisors is an integer number (22768236).
Almost surely, 2255505053 is an apocalyptic number.
It is an amenable number.
255505053 is a deficient number, since it is larger than the sum of its proper divisors (108786723).
255505053 is a wasteful number, since it uses less digits than its factorization.
255505053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49724.
The product of its (nonzero) digits is 18750, while the sum is 30.
The square root of 255505053 is about 15984.5254230459. The cubic root of 255505053 is about 634.5509487697.
It can be divided in two parts, 25550 and 5053, that added together give a palindrome (30603).
The spelling of 255505053 in words is "two hundred fifty-five million, five hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •