Search a number
-
+
255650550065 = 5101506238713
BaseRepresentation
bin1110111000010111110…
…1011101000100110001
3220102212201121112121022
43232011331131010301
513142033020100230
6313235542305225
724320154551441
oct3560575350461
9812781545538
10255650550065
119946a086139
1241668a28215
131b152934c41
14c533058121
1569b3e261e5
hex3b85f5d131

255650550065 has 8 divisors (see below), whose sum is σ = 309818092968. Its totient is φ = 202495484800.

The previous prime is 255650550059. The next prime is 255650550073. The reversal of 255650550065 is 560055056552.

It is a happy number.

It can be written as a sum of positive squares in 4 ways, for example, as 173689731121 + 81960818944 = 416761^2 + 286288^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 255650550065 - 28 = 255650549809 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 255650549998 and 255650550025.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253118852 + ... + 253119861.

It is an arithmetic number, because the mean of its divisors is an integer number (38727261621).

Almost surely, 2255650550065 is an apocalyptic number.

It is an amenable number.

255650550065 is a deficient number, since it is larger than the sum of its proper divisors (54167542903).

255650550065 is a wasteful number, since it uses less digits than its factorization.

255650550065 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 506238819.

The product of its (nonzero) digits is 1125000, while the sum is 44.

The spelling of 255650550065 in words is "two hundred fifty-five billion, six hundred fifty million, five hundred fifty thousand, sixty-five".

Divisors: 1 5 101 505 506238713 2531193565 51130110013 255650550065