Search a number
-
+
10274601059 is a prime number
BaseRepresentation
bin10011001000110100…
…11111100001100011
3222112001110210221222
421210122133201203
5132020244213214
64415312205255
7512420445062
oct114432374143
928461423858
1010274601059
1143a2820938
121ba8b3982b
13c798645c8
146d68041d9
1540205138e
hex26469f863

10274601059 has 2 divisors, whose sum is σ = 10274601060. Its totient is φ = 10274601058.

The previous prime is 10274601053. The next prime is 10274601137. The reversal of 10274601059 is 95010647201.

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

It is a weak prime.

It is a cyclic number.

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

It is a super-3 number, since 3×102746010593 (a number of 31 digits) contains 333 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210274601059 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 35.

The spelling of 10274601059 in words is "ten billion, two hundred seventy-four million, six hundred one thousand, fifty-nine".