Base | Representation |
---|---|
bin | 100011011011100110001110… |
… | …1010000000101100101110001 |
3 | 1111212111001010121200001212210 |
4 | 1012313030131100011211301 |
5 | 311322133400334443423 |
6 | 3022500514420042333 |
7 | 122434263143341620 |
oct | 10667143520054561 |
9 | 1455431117601783 |
10 | 311656202656113 |
11 | 903377205a2357 |
12 | 2ab550878333a9 |
13 | 104b90912990b3 |
14 | 56d63526656b7 |
15 | 2606d5e044b93 |
hex | 11b731d405971 |
311656202656113 has 32 divisors (see below), whose sum is σ = 475135537504000. Its totient is φ = 178002710231040.
The previous prime is 311656202656091. The next prime is 311656202656121.
311656202656113 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 311656202656113 - 25 = 311656202656081 is a prime.
It is a super-2 number, since 2×3116562026561132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311656202651113) 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 31 ways as a sum of consecutive naturals, for example, 387983973 + ... + 388786413.
It is an arithmetic number, because the mean of its divisors is an integer number (14847985547000).
Almost surely, 2311656202656113 is an apocalyptic number.
It is an amenable number.
311656202656113 is a deficient number, since it is larger than the sum of its proper divisors (163479334847887).
311656202656113 is a wasteful number, since it uses less digits than its factorization.
311656202656113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811417.
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 311656202656113 in words is "three hundred eleven trillion, six hundred fifty-six billion, two hundred two million, six hundred fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •