Search a number
-
+
10701583813 is a prime number
BaseRepresentation
bin10011111011101110…
…10011010111000101
31000121210220210012001
421331313103113011
5133404101140223
64525524025301
7526123650544
oct117567232705
930553823161
1010701583813
1145a1846348
1220a7b32231
13101716271b
147373d015b
154297949ad
hex27ddd35c5

10701583813 has 2 divisors, whose sum is σ = 10701583814. Its totient is φ = 10701583812.

The previous prime is 10701583801. The next prime is 10701583817. The reversal of 10701583813 is 31838510701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9600472324 + 1101111489 = 97982^2 + 33183^2 .

It is a cyclic number.

It is not a de Polignac number, because 10701583813 - 225 = 10668029381 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210701583813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 37.

The spelling of 10701583813 in words is "ten billion, seven hundred one million, five hundred eighty-three thousand, eight hundred thirteen".