Search a number
-
+
590465272319 = 13231112705721
BaseRepresentation
bin10001001011110100111…
…10010000100111111111
32002110002112120200222222
420211322132100213333
534133233102203234
61131131143555555
760442165001066
oct10457236204777
92073075520888
10590465272319
1120846228656a
129652975bbbb
13438b0486300
1420815c371dd
151055cc6842e
hex897a7909ff

590465272319 has 12 divisors (see below), whose sum is σ = 660004708032. Its totient is φ = 527462769600.

The previous prime is 590465272307. The next prime is 590465272333. The reversal of 590465272319 is 913272564095.

It is a happy number.

It is not a de Polignac number, because 590465272319 - 28 = 590465272063 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (590465272349) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56347622 + ... + 56358099.

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

Almost surely, 2590465272319 is an apocalyptic number.

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

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

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

The sum of its prime factors is 112705778 (or 112705765 counting only the distinct ones).

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

The spelling of 590465272319 in words is "five hundred ninety billion, four hundred sixty-five million, two hundred seventy-two thousand, three hundred nineteen".

Divisors: 1 13 31 169 403 5239 112705721 1465174373 3493877351 19047266849 45420405563 590465272319