Search a number
-
+
346931167133 is a prime number
BaseRepresentation
bin1010000110001101011…
…01010111111110011101
31020011111020012100002102
411003012231113332131
521141003334322013
6423213350534445
734031164156445
oct5030655277635
91204436170072
10346931167133
11124150665841
12572a2667425
132693bb668a5
1412b1206d125
159057914d58
hex50c6b57f9d

346931167133 has 2 divisors, whose sum is σ = 346931167134. Its totient is φ = 346931167132.

The previous prime is 346931167069. The next prime is 346931167153. The reversal of 346931167133 is 331761139643.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 227821972249 + 119109194884 = 477307^2 + 345122^2 .

It is an emirp because it is prime and its reverse (331761139643) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 346931167133 - 26 = 346931167069 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2346931167133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 734832, while the sum is 47.

The spelling of 346931167133 in words is "three hundred forty-six billion, nine hundred thirty-one million, one hundred sixty-seven thousand, one hundred thirty-three".