Search a number
-
+
590189489569 is a prime number
BaseRepresentation
bin10001001011010100000…
…10001110110110100001
32002102101022122111012001
420211222002032312201
534132202002131234
61131043533004001
760432305613541
oct10455202166641
92072338574161
10590189489569
11208330642939
1296471323601
13438682b7354
14207cb369321
151054393ed14
hex896a08eda1

590189489569 has 2 divisors, whose sum is σ = 590189489570. Its totient is φ = 590189489568.

The previous prime is 590189489551. The next prime is 590189489587. The reversal of 590189489569 is 965984981095.

It is a balanced prime because it is at equal distance from previous prime (590189489551) and next prime (590189489587).

It can be written as a sum of positive squares in only one way, i.e., 532991983969 + 57197505600 = 730063^2 + 239160^2 .

It is a cyclic number.

It is not a de Polignac number, because 590189489569 - 25 = 590189489537 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (590189489599) 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 as a sum of consecutive naturals, namely, 295094744784 + 295094744785.

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

Almost surely, 2590189489569 is an apocalyptic number.

It is an amenable number.

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

590189489569 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 251942400, while the sum is 73.

The spelling of 590189489569 in words is "five hundred ninety billion, one hundred eighty-nine million, four hundred eighty-nine thousand, five hundred sixty-nine".