Base | Representation |
---|---|
bin | 101101010011001101010… |
… | …100110100101001110011 |
3 | 102000121012101210102222021 |
4 | 231103031110310221303 |
5 | 402000411241011011 |
6 | 10342032025252311 |
7 | 440623032562543 |
oct | 55231524645163 |
9 | 12017171712867 |
10 | 3113001110131 |
11 | aa0241a752a0 |
12 | 4233a1934097 |
13 | 197729a0c703 |
14 | aa9548d1323 |
15 | 55e9a04e471 |
hex | 2d4cd534a73 |
3113001110131 has 16 divisors (see below), whose sum is σ = 3468741677568. Its totient is φ = 2769400799200.
The previous prime is 3113001110081. The next prime is 3113001110203. The reversal of 3113001110131 is 1310111003113.
3113001110131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3113001110131 - 211 = 3113001108083 is a prime.
It is a super-2 number, since 2×31130011101312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3113001110431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3310581 + ... + 4145593.
It is an arithmetic number, because the mean of its divisors is an integer number (216796354848).
Almost surely, 23113001110131 is an apocalyptic number.
3113001110131 is a deficient number, since it is larger than the sum of its proper divisors (355740567437).
3113001110131 is a wasteful number, since it uses less digits than its factorization.
3113001110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842282.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 3113001110131 its reverse (1310111003113), we get a palindrome (4423112113244).
The spelling of 3113001110131 in words is "three trillion, one hundred thirteen billion, one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •