Search a number
-
+
259909512290 = 2525990951229
BaseRepresentation
bin1111001000001111010…
…0000110110001100010
3220211212112121020102222
43302003310012301202
513224243313343130
6315222322511042
724530541255101
oct3620364066142
9824775536388
10259909512290
11a025516452a
1242457205482
131b6810b642c
14c81893c038
156b62ca0ce5
hex3c83d06c62

259909512290 has 8 divisors (see below), whose sum is σ = 467837122140. Its totient is φ = 103963804912.

The previous prime is 259909512283. The next prime is 259909512293. The reversal of 259909512290 is 92215909952.

It can be written as a sum of positive squares in 2 ways, for example, as 259568851441 + 340660849 = 509479^2 + 18457^2 .

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

It is a super-2 number, since 2×2599095122902 (a number of 24 digits) contains 22 as substring.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (259909512293) 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 3 ways as a sum of consecutive naturals, for example, 12995475605 + ... + 12995475624.

Almost surely, 2259909512290 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25990951236.

The product of its (nonzero) digits is 1312200, while the sum is 53.

The spelling of 259909512290 in words is "two hundred fifty-nine billion, nine hundred nine million, five hundred twelve thousand, two hundred ninety".

Divisors: 1 2 5 10 25990951229 51981902458 129954756145 259909512290