Search a number
-
+
1010011010497 is a prime number
BaseRepresentation
bin11101011001010010101…
…10001111010111000001
310120120000101220110011121
432230221112033113001
5113022000304313442
62051554225112241
7132654004636366
oct16545126172701
93516011813147
101010011010497
1135a385980295
121438b6788681
137432233c7a8
1436c55c3446d
151b41559b967
hexeb2958f5c1

1010011010497 has 2 divisors, whose sum is σ = 1010011010498. Its totient is φ = 1010011010496.

The previous prime is 1010011010479. The next prime is 1010011010501. The reversal of 1010011010497 is 7940101100101.

Together with previous prime (1010011010479) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 933173388081 + 76837622416 = 966009^2 + 277196^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010011010497 - 211 = 1010011008449 is a prime.

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

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

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

Almost surely, 21010011010497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 25.

Adding to 1010011010497 its reverse (7940101100101), we get a palindrome (8950112110598).

The spelling of 1010011010497 in words is "one trillion, ten billion, eleven million, ten thousand, four hundred ninety-seven".