Base | Representation |
---|---|
bin | 101101010001100011010… |
… | …011001111010101000011 |
3 | 102000102121102200001012202 |
4 | 231101203103033111003 |
5 | 401433240402411321 |
6 | 10341135323343415 |
7 | 440530663203131 |
oct | 55214323172503 |
9 | 12012542601182 |
10 | 3111222310211 |
11 | a9a509980614 |
12 | 422b86081b6b |
13 | 197505333092 |
14 | aa826576751 |
15 | 55de3cd270b |
hex | 2d4634cf543 |
3111222310211 has 8 divisors (see below), whose sum is σ = 3167213400000. Its totient is φ = 3055339837480.
The previous prime is 3111222310193. The next prime is 3111222310271. The reversal of 3111222310211 is 1120132221113.
3111222310211 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 cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3111222310211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3111222310271) 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, 27096461 + ... + 27211038.
It is an arithmetic number, because the mean of its divisors is an integer number (395901675000).
Almost surely, 23111222310211 is an apocalyptic number.
3111222310211 is a deficient number, since it is larger than the sum of its proper divisors (55991089789).
3111222310211 is an equidigital number, since it uses as much as digits as its factorization.
3111222310211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54308529.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 3111222310211 its reverse (1120132221113), we get a palindrome (4231354531324).
The spelling of 3111222310211 in words is "three trillion, one hundred eleven billion, two hundred twenty-two million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •