Search a number
-
+
358081056059 is a prime number
BaseRepresentation
bin1010011010111110100…
…10110100110100111011
31021020021021200101021112
411031133102310310323
521331322222243214
6432300011430535
734604403520316
oct5153722646473
91236237611245
10358081056059
1112895246a381
125949475544b
13279c7b516bc
141348cbd997d
1594ab710a3e
hex535f4b4d3b

358081056059 has 2 divisors, whose sum is σ = 358081056060. Its totient is φ = 358081056058.

The previous prime is 358081056001. The next prime is 358081056071. The reversal of 358081056059 is 950650180853.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 358081056059 - 216 = 358080990523 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 358081055998 and 358081056016.

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

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

Almost surely, 2358081056059 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1296000, while the sum is 50.

The spelling of 358081056059 in words is "three hundred fifty-eight billion, eighty-one million, fifty-six thousand, fifty-nine".