Search a number
-
+
103032230795713 is a prime number
BaseRepresentation
bin10111011011010100001111…
…100001000101100111000001
3111111210210012022111212112101
4113123110033201011213001
5102001040002040430323
61003044204200030401
730462555504505642
oct2733241741054701
9444723168455471
10103032230795713
112a9137a626a7aa
12b680405762401
134564b892627ab
141b62b025296c9
15bda1888dddad
hex5db50f8459c1

103032230795713 has 2 divisors, whose sum is σ = 103032230795714. Its totient is φ = 103032230795712.

The previous prime is 103032230795647. The next prime is 103032230795717. The reversal of 103032230795713 is 317597032230301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102783342556944 + 248888238769 = 10138212^2 + 498887^2 .

It is a cyclic number.

It is not a de Polignac number, because 103032230795713 - 233 = 103023640861121 is a prime.

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

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

Almost surely, 2103032230795713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 714420, while the sum is 46.

The spelling of 103032230795713 in words is "one hundred three trillion, thirty-two billion, two hundred thirty million, seven hundred ninety-five thousand, seven hundred thirteen".