Search a number
-
+
495956809231 = 13291315535303
BaseRepresentation
bin1110011011110010101…
…01000101011000001111
31202102011002020100012021
413031321111011120033
531111204420343411
61015501151351011
750555162215222
oct7157125053017
91672132210167
10495956809231
11181374764424
1280152b22467
13379cb5b63c0
141a00c2695b9
15cd7abcaa71
hex737954560f

495956809231 has 8 divisors (see below), whose sum is σ = 552524827680. Its totient is φ = 442019861472.

The previous prime is 495956809151. The next prime is 495956809237. The reversal of 495956809231 is 132908659594.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-495956809231 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 495956809231.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (495956809237) 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, 657767275 + ... + 657768028.

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

Almost surely, 2495956809231 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1315535345.

The product of its (nonzero) digits is 20995200, while the sum is 61.

The spelling of 495956809231 in words is "four hundred ninety-five billion, nine hundred fifty-six million, eight hundred nine thousand, two hundred thirty-one".

Divisors: 1 13 29 377 1315535303 17101958939 38150523787 495956809231