Search a number
-
+
10575313253 = 59917654947
BaseRepresentation
bin10011101100101011…
…00111100101100101
31000022000022120112122
421312111213211211
5133124240011003
64505213355325
7523031452031
oct116625474545
930260276478
1010575313253
11453754140a
122071798b45
13cc6c5160b
147247211c1
1541d651238
hex276567965

10575313253 has 4 divisors (see below), whose sum is σ = 10592968800. Its totient is φ = 10557657708.

The previous prime is 10575313201. The next prime is 10575313319. The reversal of 10575313253 is 35231357501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10575313253 - 220 = 10574264677 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10575315253) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8826875 + ... + 8828072.

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

Almost surely, 210575313253 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17655546.

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

The spelling of 10575313253 in words is "ten billion, five hundred seventy-five million, three hundred thirteen thousand, two hundred fifty-three".

Divisors: 1 599 17654947 10575313253