Base | Representation |
---|---|
bin | 101101010001100011110… |
… | …001110011000111011001 |
3 | 102000102121222202001002211 |
4 | 231101203301303013121 |
5 | 401433244430233423 |
6 | 10341140211155121 |
7 | 440531121246415 |
oct | 55214361630731 |
9 | 12012558661084 |
10 | 3111230321113 |
11 | a9a5134522a2 |
12 | 422b888a5aa1 |
13 | 197506ba9465 |
14 | aa82765dd45 |
15 | 55de486610d |
hex | 2d463c731d9 |
3111230321113 has 8 divisors (see below), whose sum is σ = 3266026364160. Its totient is φ = 2959836389040.
The previous prime is 3111230321107. The next prime is 3111230321137.
3111230321113 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3111230321113 - 25 = 3111230321081 is a prime.
It is a super-2 number, since 2×31112303211132 (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 (3111230321513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 850525870 + ... + 850529527.
It is an arithmetic number, because the mean of its divisors is an integer number (408253295520).
Almost surely, 23111230321113 is an apocalyptic number.
It is an amenable number.
3111230321113 is a deficient number, since it is larger than the sum of its proper divisors (154796043047).
3111230321113 is a wasteful number, since it uses less digits than its factorization.
3111230321113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1701055487.
The product of its (nonzero) digits is 324, while the sum is 22.
It can be divided in two parts, 3111230 and 321113, that added together give a palindrome (3432343).
The spelling of 3111230321113 in words is "three trillion, one hundred eleven billion, two hundred thirty million, three hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •