Base | Representation |
---|---|
bin | 101101010001100010101… |
… | …111110000110100100101 |
3 | 102000102120210011120000101 |
4 | 231101202233300310211 |
5 | 401433231012311323 |
6 | 10341134352144101 |
7 | 440530521150340 |
oct | 55214257606445 |
9 | 12012523146011 |
10 | 3111213010213 |
11 | a9a5046a9370 |
12 | 422b82b38031 |
13 | 197503428019 |
14 | aa825235457 |
15 | 55de3096dad |
hex | 2d462bf0d25 |
3111213010213 has 8 divisors (see below), whose sum is σ = 3878914921920. Its totient is φ = 2424321826080.
The previous prime is 3111213010183. The next prime is 3111213010223. The reversal of 3111213010213 is 3120103121113.
3111213010213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-3111213010213 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 (3111213010223) 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, 20202681808 + ... + 20202681961.
It is an arithmetic number, because the mean of its divisors is an integer number (484864365240).
Almost surely, 23111213010213 is an apocalyptic number.
It is an amenable number.
3111213010213 is a deficient number, since it is larger than the sum of its proper divisors (767701911707).
3111213010213 is a wasteful number, since it uses less digits than its factorization.
3111213010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40405363787.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 3111213010213 its reverse (3120103121113), we get a palindrome (6231316131326).
The spelling of 3111213010213 in words is "three trillion, one hundred eleven billion, two hundred thirteen million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •