Search a number
-
+
311022490931 = 1723811980831
BaseRepresentation
bin1001000011010100110…
…00101001010100110011
31002201210200200120201222
410201222120221110303
520043433224202211
6354514243215255
731320266360405
oct4415230512463
91081720616658
10311022490931
1110a9a40a6939
125034097752b
13234385cc3a9
14110a6dc8b75
1581551e21db
hex486a629533

311022490931 has 16 divisors (see below), whose sum is σ = 344060172288. Its totient is φ = 279654249600.

The previous prime is 311022490927. The next prime is 311022490939. The reversal of 311022490931 is 139094220113.

It is a cyclic number.

It is not a de Polignac number, because 311022490931 - 22 = 311022490927 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 311022490891 and 311022490900.

It is not an unprimeable number, because it can be changed into a prime (311022490939) 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 in 15 ways as a sum of consecutive naturals, for example, 173315 + ... + 807516.

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

Almost surely, 2311022490931 is an apocalyptic number.

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

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

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

The sum of its prime factors is 981682.

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

The spelling of 311022490931 in words is "three hundred eleven billion, twenty-two million, four hundred ninety thousand, nine hundred thirty-one".

Divisors: 1 17 23 391 811 13787 18653 317101 980831 16674127 22559113 383504921 795453941 13522716997 18295440643 311022490931