Search a number
-
+
350513055352013 is a prime number
BaseRepresentation
bin100111110110010100010111…
…0001001110100010011001101
31200222001201110111021011101112
41033230220232021310103031
5331420301214132231023
63241251250310221405
7133554506160563411
oct11754505611642315
91628051414234345
10350513055352013
11a175882a987224
123338b941054865
1312077315957a08
14627accb0bad41
152a7c9b0339478
hex13eca2e2744cd

350513055352013 has 2 divisors, whose sum is σ = 350513055352014. Its totient is φ = 350513055352012.

The previous prime is 350513055352007. The next prime is 350513055352111. The reversal of 350513055352013 is 310253550315053.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 306168350442889 + 44344704909124 = 17497667^2 + 6659182^2 .

It is a cyclic number.

It is not a de Polignac number, because 350513055352013 - 28 = 350513055351757 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2350513055352013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 506250, while the sum is 41.

The spelling of 350513055352013 in words is "three hundred fifty trillion, five hundred thirteen billion, fifty-five million, three hundred fifty-two thousand, thirteen".