Base | Representation |
---|---|
bin | 1001000011011111011… |
… | …11010001110111010111 |
3 | 1002202000221200212122201 |
4 | 10201233233101313113 |
5 | 20044124222411411 |
6 | 354531212305331 |
7 | 31322440001302 |
oct | 4415757216727 |
9 | 1082027625581 |
10 | 311112310231 |
11 | 10aa3a874468 |
12 | 50366a72247 |
13 | 234510b9cc8 |
14 | 110b4cc9b39 |
15 | 815d0353c1 |
hex | 486fbd1dd7 |
311112310231 has 4 divisors (see below), whose sum is σ = 311160320464. Its totient is φ = 311064300000.
The previous prime is 311112310199. The next prime is 311112310247. The reversal of 311112310231 is 132013211113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 311112310231 - 25 = 311112310199 is a prime.
It is a super-2 number, since 2×3111123102312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 311112310199 and 311112310208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311112310291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23995395 + ... + 24008356.
It is an arithmetic number, because the mean of its divisors is an integer number (77790080116).
Almost surely, 2311112310231 is an apocalyptic number.
311112310231 is a deficient number, since it is larger than the sum of its proper divisors (48010233).
311112310231 is an equidigital number, since it uses as much as digits as its factorization.
311112310231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48010232.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 311112310231 its reverse (132013211113), we get a palindrome (443125521344).
The spelling of 311112310231 in words is "three hundred eleven billion, one hundred twelve million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •