Base | Representation |
---|---|
bin | 101101011011101100010… |
… | …100010011100111101001 |
3 | 102001110201021122221211001 |
4 | 231123230110103213221 |
5 | 402123040404044423 |
6 | 10350140014035001 |
7 | 441364551441364 |
oct | 55335424234751 |
9 | 12043637587731 |
10 | 3122111003113 |
11 | aa40972a4773 |
12 | 4251047a8a61 |
13 | 19854c18842b |
14 | ab17a7510db |
15 | 5632ebd6cad |
hex | 2d6ec5139e9 |
3122111003113 has 4 divisors (see below), whose sum is σ = 3122173586560. Its totient is φ = 3122048419668.
The previous prime is 3122111003017. The next prime is 3122111003149. The reversal of 3122111003113 is 3113001112213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3122111003113 - 213 = 3122110994921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3122111003213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31216833 + ... + 31316686.
It is an arithmetic number, because the mean of its divisors is an integer number (780543396640).
Almost surely, 23122111003113 is an apocalyptic number.
It is an amenable number.
3122111003113 is a deficient number, since it is larger than the sum of its proper divisors (62583447).
3122111003113 is an equidigital number, since it uses as much as digits as its factorization.
3122111003113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62583446.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 3122111003113 its reverse (3113001112213), we get a palindrome (6235112115326).
The spelling of 3122111003113 in words is "three trillion, one hundred twenty-two billion, one hundred eleven million, three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •