Base | Representation |
---|---|
bin | 101101001000000011010… |
… | …100111010110011100111 |
3 | 101222110021120100220202022 |
4 | 231020003110322303213 |
5 | 401301343140444421 |
6 | 10332331231533355 |
7 | 440020135546430 |
oct | 55100324726347 |
9 | 11873246326668 |
10 | 3101022203111 |
11 | a96155210138 |
12 | 420bba08a25b |
13 | 19656b051951 |
14 | aa139a04487 |
15 | 559e85987ab |
hex | 2d20353ace7 |
3101022203111 has 32 divisors (see below), whose sum is σ = 3675559587840. Its totient is φ = 2561734895616.
The previous prime is 3101022203057. The next prime is 3101022203113. The reversal of 3101022203111 is 1113022201013.
3101022203111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3101022203111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3101022203111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101022203113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3519830 + ... + 4311756.
It is an arithmetic number, because the mean of its divisors is an integer number (114861237120).
Almost surely, 23101022203111 is an apocalyptic number.
3101022203111 is a deficient number, since it is larger than the sum of its proper divisors (574537384729).
3101022203111 is an equidigital number, since it uses as much as digits as its factorization.
3101022203111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 792183.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 3101022203111 its reverse (1113022201013), we get a palindrome (4214044404124).
The spelling of 3101022203111 in words is "three trillion, one hundred one billion, twenty-two million, two hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •