Search a number
-
+
103014925089751 is a prime number
BaseRepresentation
bin10111011011000100001000…
…000001000011101111010111
3111111202010112020202220212201
4113123010020001003233113
5102000244031310333001
61003032223034425331
730461403606441463
oct2733041001035727
9444663466686781
10103014925089751
112a90742568a774
12b678b95b92247
13456335bb243ac
141b61d3ddcd4a3
15bd99c447c501
hex5db108043bd7

103014925089751 has 2 divisors, whose sum is σ = 103014925089752. Its totient is φ = 103014925089750.

The previous prime is 103014925089701. The next prime is 103014925089767. The reversal of 103014925089751 is 157980529410301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 103014925089751 - 27 = 103014925089623 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2103014925089751 is an apocalyptic number.

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

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

103014925089751 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2721600, while the sum is 55.

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