Base | Representation |
---|---|
bin | 101011110101001111111… |
… | …100011010111000011111 |
3 | 101122221210100121100102212 |
4 | 223311033330122320133 |
5 | 343322302002011221 |
6 | 10223425025511035 |
7 | 430421655502244 |
oct | 53651774327037 |
9 | 11587710540385 |
10 | 3012113313311 |
11 | a61480492313 |
12 | 4079267a247b |
13 | 18b06c2b9c0b |
14 | a5b039ad5cb |
15 | 53542de8b5b |
hex | 2bd4ff1ae1f |
3012113313311 has 4 divisors (see below), whose sum is σ = 3016670217624. Its totient is φ = 3007556409000.
The previous prime is 3012113313289. The next prime is 3012113313317. The reversal of 3012113313311 is 1133133112103.
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 3012113313311 - 230 = 3011039571487 is a prime.
It is a super-4 number, since 4×30121133133114 (a number of 51 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012113313317) 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, 2278451165 + ... + 2278452486.
It is an arithmetic number, because the mean of its divisors is an integer number (754167554406).
Almost surely, 23012113313311 is an apocalyptic number.
3012113313311 is a deficient number, since it is larger than the sum of its proper divisors (4556904313).
3012113313311 is an equidigital number, since it uses as much as digits as its factorization.
3012113313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4556904312.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 3012113313311 its reverse (1133133112103), we get a palindrome (4145246425414).
The spelling of 3012113313311 in words is "three trillion, twelve billion, one hundred thirteen million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •