Search a number
-
+
103014925089577 is a prime number
BaseRepresentation
bin10111011011000100001000…
…000001000011101100101001
3111111202010112020202220122021
4113123010020001003230221
5102000244031310331302
61003032223034424441
730461403606441124
oct2733041001035451
9444663466686567
10103014925089577
112a90742568a626
12b678b95b92121
13456335bb242a7
141b61d3ddcd3bb
15bd99c447c437
hex5db108043b29

103014925089577 has 2 divisors, whose sum is σ = 103014925089578. Its totient is φ = 103014925089576.

The previous prime is 103014925089487. The next prime is 103014925089619. The reversal of 103014925089577 is 775980529410301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53958853057561 + 49056072032016 = 7345669^2 + 7004004^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2103014925089577 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19051200, while the sum is 61.

The spelling of 103014925089577 in words is "one hundred three trillion, fourteen billion, nine hundred twenty-five million, eighty-nine thousand, five hundred seventy-seven".