Search a number
-
+
350423250551131 is a prime number
BaseRepresentation
bin100111110101101010100010…
…1010111101100000101011011
31200221202010122211200121010011
41033223111011113230011123
5331412313304120114011
63241142115141502351
7133545146551430452
oct11753250527540533
91627663584617104
10350423250551131
11a172373646a11a
12333764597119b7
131206ba033cb794
14627680c0b1b99
152a7a4a61b9621
hex13eb5455ec15b

350423250551131 has 2 divisors, whose sum is σ = 350423250551132. Its totient is φ = 350423250551130.

The previous prime is 350423250551113. The next prime is 350423250551219. The reversal of 350423250551131 is 131155052324053.

Together with previous prime (350423250551113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 350423250551131 - 217 = 350423250420059 is a prime.

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

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

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

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

Almost surely, 2350423250551131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 40.

The spelling of 350423250551131 in words is "three hundred fifty trillion, four hundred twenty-three billion, two hundred fifty million, five hundred fifty-one thousand, one hundred thirty-one".