Base | Representation |
---|---|
bin | 1001000011011111100… |
… | …10010110010111111011 |
3 | 1002202001000012202202211 |
4 | 10201233302112113323 |
5 | 20044124424141011 |
6 | 354531241435551 |
7 | 31322446563040 |
oct | 4415762262773 |
9 | 1082030182684 |
10 | 311113115131 |
11 | 10aa40274175 |
12 | 5036719bbb7 |
13 | 2345130c490 |
14 | 110b50591c7 |
15 | 815d143b21 |
hex | 486fc965fb |
311113115131 has 64 divisors (see below), whose sum is σ = 393739315200. Its totient is φ = 239305651200.
The previous prime is 311113115123. The next prime is 311113115197. The reversal of 311113115131 is 131511311113.
It is not a de Polignac number, because 311113115131 - 23 = 311113115123 is a prime.
It is a super-2 number, since 2×3111131151312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (311113115111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 378943701 + ... + 378944521.
It is an arithmetic number, because the mean of its divisors is an integer number (6152176800).
Almost surely, 2311113115131 is an apocalyptic number.
311113115131 is a deficient number, since it is larger than the sum of its proper divisors (82626200069).
311113115131 is a wasteful number, since it uses less digits than its factorization.
311113115131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1660.
The product of its digits is 135, while the sum is 22.
Adding to 311113115131 its reverse (131511311113), we get a palindrome (442624426244).
The spelling of 311113115131 in words is "three hundred eleven billion, one hundred thirteen million, one hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •