Search a number
-
+
311401123 = 1127333511
BaseRepresentation
bin10010100011111…
…001101010100011
3210200221211000221
4102203321222203
51114204313443
650522223511
710500602665
oct2243715243
9720854027
10311401123
1114a861300
1288354b97
134c690327
142d500535
151c511eed
hex128f9aa3

311401123 has 12 divisors (see below), whose sum is σ = 342848464. Its totient is φ = 282625200.

The previous prime is 311401099. The next prime is 311401133. The reversal of 311401123 is 321104113.

It is a de Polignac number, because none of the positive numbers 2k-311401123 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 86938 + ... + 90448.

Almost surely, 2311401123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4266 (or 4255 counting only the distinct ones).

The product of its (nonzero) digits is 72, while the sum is 16.

The square root of 311401123 is about 17646.5612230825. The cubic root of 311401123 is about 677.8080536975.

Adding to 311401123 its reverse (321104113), we get a palindrome (632505236).

The spelling of 311401123 in words is "three hundred eleven million, four hundred one thousand, one hundred twenty-three".

Divisors: 1 11 121 733 3511 8063 38621 88693 424831 2573563 28309193 311401123