Search a number
-
+
31050257113 = 304691019077
BaseRepresentation
bin11100111010101111…
…010101001011011001
32222010221112111021201
4130322233111023121
51002042331211423
622133030434201
72146311554641
oct347257251331
988127474251
1031050257113
1112194073817
126026802961
132c0ab4a705
141707b19521
15c1ae362ad
hex73abd52d9

31050257113 has 4 divisors (see below), whose sum is σ = 31051306660. Its totient is φ = 31049207568.

The previous prime is 31050257111. The next prime is 31050257137. The reversal of 31050257113 is 31175205013.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 6735156624 + 24315100489 = 82068^2 + 155933^2 .

It is a cyclic number.

It is not a de Polignac number, because 31050257113 - 21 = 31050257111 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 231050257113 is an apocalyptic number.

It is an amenable number.

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

31050257113 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1049546.

The product of its (nonzero) digits is 3150, while the sum is 28.

The spelling of 31050257113 in words is "thirty-one billion, fifty million, two hundred fifty-seven thousand, one hundred thirteen".

Divisors: 1 30469 1019077 31050257113