Base | Representation |
---|---|
bin | 100011010111101100101100… |
… | …0001110100110111011011001 |
3 | 1111210120210221010012010212012 |
4 | 1012233121120032212323121 |
5 | 311234343404212241441 |
6 | 3021410411420555305 |
7 | 122350462410253331 |
oct | 10657313016467331 |
9 | 1453523833163765 |
10 | 311120321212121 |
11 | 90150429485a13 |
12 | 2aa892520b2b35 |
13 | 1047a69c42a075 |
14 | 56b8437c4a0c1 |
15 | 25e7e482bc9eb |
hex | 11af6583a6ed9 |
311120321212121 has 16 divisors (see below), whose sum is σ = 326666702745600. Its totient is φ = 295895540844288.
The previous prime is 311120321212093. The next prime is 311120321212147. The reversal of 311120321212121 is 121212123021113.
It is not a de Polignac number, because 311120321212121 - 234 = 311103141342937 is a prime.
It is a super-2 number, since 2×3111203212121212 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311120321211121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40753265 + ... + 47781473.
It is an arithmetic number, because the mean of its divisors is an integer number (20416668921600).
Almost surely, 2311120321212121 is an apocalyptic number.
It is an amenable number.
311120321212121 is a deficient number, since it is larger than the sum of its proper divisors (15546381533479).
311120321212121 is a wasteful number, since it uses less digits than its factorization.
311120321212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7051088.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 311120321212121 its reverse (121212123021113), we get a palindrome (432332444233234).
The spelling of 311120321212121 in words is "three hundred eleven trillion, one hundred twenty billion, three hundred twenty-one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •