Base | Representation |
---|---|
bin | 101101010011001110100… |
… | …010010011111000000111 |
3 | 102000121020211000110010212 |
4 | 231103032202103320013 |
5 | 402000431441014421 |
6 | 10342034032510035 |
7 | 440623400334215 |
oct | 55231642237007 |
9 | 12017224013125 |
10 | 3113021423111 |
11 | aa0252489786 |
12 | 4233a86ab31b |
13 | 197730ca2422 |
14 | aa95749bcb5 |
15 | 55e9bc12e5b |
hex | 2d4ce893e07 |
3113021423111 has 4 divisors (see below), whose sum is σ = 3147999192000. Its totient is φ = 3078043654224.
The previous prime is 3113021423087. The next prime is 3113021423119. The reversal of 3113021423111 is 1113241203113.
3113021423111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3113021423111 - 226 = 3112954314247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113021423119) 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, 17488884311 + ... + 17488884488.
It is an arithmetic number, because the mean of its divisors is an integer number (786999798000).
Almost surely, 23113021423111 is an apocalyptic number.
3113021423111 is a deficient number, since it is larger than the sum of its proper divisors (34977768889).
3113021423111 is an equidigital number, since it uses as much as digits as its factorization.
3113021423111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34977768888.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 3113021423111 its reverse (1113241203113), we get a palindrome (4226262626224).
The spelling of 3113021423111 in words is "three trillion, one hundred thirteen billion, twenty-one million, four hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •