Search a number
-
+
927050393 is a prime number
BaseRepresentation
bin110111010000011…
…010101010011001
32101121102001001202
4313100122222121
53344311103033
6231553523545
731654540553
oct6720325231
92347361052
10927050393
11436328755
1221a5735b5
1311a0a7c39
148b19c4d3
15565c18e8
hex3741aa99

927050393 has 2 divisors, whose sum is σ = 927050394. Its totient is φ = 927050392.

The previous prime is 927050389. The next prime is 927050431. The reversal of 927050393 is 393050729.

927050393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (927050431) can be obtained adding 927050393 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 585059344 + 341991049 = 24188^2 + 18493^2 .

It is a cyclic number.

It is not a de Polignac number, because 927050393 - 22 = 927050389 is a prime.

It is a super-2 number, since 2×9270503932 = 1718844862322908898, which contains 22 as substring.

It is a weakly prime.

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

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

Almost surely, 2927050393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51030, while the sum is 38.

The square root of 927050393 is about 30447.5022456687. The cubic root of 927050393 is about 975.0669751932.

The spelling of 927050393 in words is "nine hundred twenty-seven million, fifty thousand, three hundred ninety-three".