Search a number
-
+
6909331473433 is a prime number
BaseRepresentation
bin110010010001011010000…
…1111111000010000011001
3220110112012012010121012201
41210202310033320100121
51401200302324122213
622410034132210201
71312116450335464
oct144426417702031
926415165117181
106909331473433
11222425a544364
129370a9169961
133b17161667cc
1419c5b06342db
15beada81a6dd
hex648b43f8419

6909331473433 has 2 divisors, whose sum is σ = 6909331473434. Its totient is φ = 6909331473432.

The previous prime is 6909331473379. The next prime is 6909331473449. The reversal of 6909331473433 is 3343741339096.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5615179511769 + 1294151961664 = 2369637^2 + 1137608^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (6909331473493) 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, 3454665736716 + 3454665736717.

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

Almost surely, 26909331473433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13226976, while the sum is 55.

The spelling of 6909331473433 in words is "six trillion, nine hundred nine billion, three hundred thirty-one million, four hundred seventy-three thousand, four hundred thirty-three".