Base | Representation |
---|---|
bin | 101101010010011010101… |
… | …010000111101010100011 |
3 | 102000112000011021011120022 |
4 | 231102122222013222203 |
5 | 401442141132230021 |
6 | 10341411421504055 |
7 | 440563001331665 |
oct | 55223252075243 |
9 | 12015004234508 |
10 | 3112151055011 |
11 | a9a9461562a9 |
12 | 4231a511202b |
13 | 19762288230b |
14 | aa8b3a56535 |
15 | 55e4a5db1ab |
hex | 2d49aa87aa3 |
3112151055011 has 4 divisors (see below), whose sum is σ = 3119543338224. Its totient is φ = 3104758771800.
The previous prime is 3112151055007. The next prime is 3112151055043. The reversal of 3112151055011 is 1105501512113.
It is a happy number.
3112151055011 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 3112151055011 - 22 = 3112151055007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3112151055071) 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, 3696140975 + ... + 3696141816.
It is an arithmetic number, because the mean of its divisors is an integer number (779885834556).
Almost surely, 23112151055011 is an apocalyptic number.
3112151055011 is a deficient number, since it is larger than the sum of its proper divisors (7392283213).
3112151055011 is an equidigital number, since it uses as much as digits as its factorization.
3112151055011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7392283212.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 3112151055011 its reverse (1105501512113), we get a palindrome (4217652567124).
The spelling of 3112151055011 in words is "three trillion, one hundred twelve billion, one hundred fifty-one million, fifty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •