Base | Representation |
---|---|
bin | 100011011001111101100000… |
… | …0101010100010111111110111 |
3 | 1111211200112122112100211200012 |
4 | 1012303323000222202333313 |
5 | 311304442311104334311 |
6 | 3022205322535410435 |
7 | 122412112132036253 |
oct | 10663730052427767 |
9 | 1454615575324605 |
10 | 311431311011831 |
11 | 9026030608340a |
12 | 2ab19583b23a1b |
13 | 104a0b0102152a |
14 | 56c94da765263 |
15 | 260109a6a378b |
hex | 11b3ec0aa2ff7 |
311431311011831 has 2 divisors, whose sum is σ = 311431311011832. Its totient is φ = 311431311011830.
The previous prime is 311431311011801. The next prime is 311431311011927. The reversal of 311431311011831 is 138110113134113.
It is a weak prime.
It is an emirp because it is prime and its reverse (138110113134113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 311431311011831 - 26 = 311431311011767 is a prime.
It is a super-2 number, since 2×3114313110118312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311431311011801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155715655505915 + 155715655505916.
It is an arithmetic number, because the mean of its divisors is an integer number (155715655505916).
Almost surely, 2311431311011831 is an apocalyptic number.
311431311011831 is a deficient number, since it is larger than the sum of its proper divisors (1).
311431311011831 is an equidigital number, since it uses as much as digits as its factorization.
311431311011831 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 32.
Adding to 311431311011831 its reverse (138110113134113), we get a palindrome (449541424145944).
The spelling of 311431311011831 in words is "three hundred eleven trillion, four hundred thirty-one billion, three hundred eleven million, eleven thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •