Base | Representation |
---|---|
bin | 100001101010101110001… |
… | …111001110100010110001 |
3 | 22012011211211222200021122 |
4 | 201222232033032202301 |
5 | 300401241100220221 |
6 | 4530505500232025 |
7 | 326103360253232 |
oct | 41525617164261 |
9 | 8164754880248 |
10 | 2313615632561 |
11 | 812220788382 |
12 | 31448923b615 |
13 | 13a233174a9c |
14 | 7dda0013089 |
15 | 402b0b97eab |
hex | 21aae3ce8b1 |
2313615632561 has 8 divisors (see below), whose sum is σ = 2435408797920. Its totient is φ = 2191824859392.
The previous prime is 2313615632543. The next prime is 2313615632567. The reversal of 2313615632561 is 1652365163132.
2313615632561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2313615632561 is a prime.
It is a super-3 number, since 3×23136156325613 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2313615632567) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1593041 + ... + 2676753.
It is an arithmetic number, because the mean of its divisors is an integer number (304426099740).
Almost surely, 22313615632561 is an apocalyptic number.
It is an amenable number.
2313615632561 is a deficient number, since it is larger than the sum of its proper divisors (121793165359).
2313615632561 is a wasteful number, since it uses less digits than its factorization.
2313615632561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196095.
The product of its digits is 583200, while the sum is 44.
The spelling of 2313615632561 in words is "two trillion, three hundred thirteen billion, six hundred fifteen million, six hundred thirty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •