Search a number
-
+
31435004153569 is a prime number
BaseRepresentation
bin1110010010111000010000…
…10000011000111011100001
311010022011020111011210112011
413021130020100120323201
513110012342030403234
6150505012550232521
76423050464422142
oct711341020307341
9133264214153464
1031435004153569
11a01a568376a85
123638393355741
131470401092513
147a9668863ac9
15397a6b039b64
hex1c9708418ee1

31435004153569 has 2 divisors, whose sum is σ = 31435004153570. Its totient is φ = 31435004153568.

The previous prime is 31435004153489. The next prime is 31435004153573. The reversal of 31435004153569 is 96535140053413.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 29447716230625 + 1987287922944 = 5426575^2 + 1409712^2 .

It is a cyclic number.

It is not a de Polignac number, because 31435004153569 - 229 = 31434467282657 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (31435004150569) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15717502076784 + 15717502076785.

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

Almost surely, 231435004153569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2916000, while the sum is 49.

The spelling of 31435004153569 in words is "thirty-one trillion, four hundred thirty-five billion, four million, one hundred fifty-three thousand, five hundred sixty-nine".