Search a number
-
+
311550131 = 1090928559
BaseRepresentation
bin10010100100011…
…110000010110011
3210201020101102202
4102210132002303
51114224101011
650525333415
710502063264
oct2244360263
9721211382
10311550131
1114a953252
128840726b
134c7130b9
142d53c96b
151c54123b
hex1291e0b3

311550131 has 4 divisors (see below), whose sum is σ = 311589600. Its totient is φ = 311510664.

The previous prime is 311550121. The next prime is 311550137. The reversal of 311550131 is 131055113.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 131055113 = 718722159.

It is a cyclic number.

It is not a de Polignac number, because 311550131 - 210 = 311549107 is a prime.

It is a super-2 number, since 2×3115501312 = 194126968252234322, which contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2311550131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 39468.

The product of its (nonzero) digits is 225, while the sum is 20.

The square root of 311550131 is about 17650.7827305193. The cubic root of 311550131 is about 677.9161487018.

The spelling of 311550131 in words is "three hundred eleven million, five hundred fifty thousand, one hundred thirty-one".

Divisors: 1 10909 28559 311550131