Base | Representation |
---|---|
bin | 1001000100000101100… |
… | …00101010011011111001 |
3 | 1002202212012012100120021 |
4 | 10202002300222123321 |
5 | 20100302422040441 |
6 | 355023012330441 |
7 | 31333363364164 |
oct | 4420260523371 |
9 | 1082765170507 |
10 | 311431440121 |
11 | 110093a2447a |
12 | 50435913a21 |
13 | 234a2255169 |
14 | 1110543cadb |
15 | 817b0723d1 |
hex | 4882c2a6f9 |
311431440121 has 4 divisors (see below), whose sum is σ = 311433897600. Its totient is φ = 311428982644.
The previous prime is 311431440101. The next prime is 311431440139. The reversal of 311431440121 is 121044134113.
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 311431440121 - 29 = 311431439609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311431440101) 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 3 ways as a sum of consecutive naturals, for example, 1027681 + ... + 1295758.
It is an arithmetic number, because the mean of its divisors is an integer number (77858474400).
Almost surely, 2311431440121 is an apocalyptic number.
It is an amenable number.
311431440121 is a deficient number, since it is larger than the sum of its proper divisors (2457479).
311431440121 is a wasteful number, since it uses less digits than its factorization.
311431440121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457478.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 311431440121 its reverse (121044134113), we get a palindrome (432475574234).
The spelling of 311431440121 in words is "three hundred eleven billion, four hundred thirty-one million, four hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •