Base | Representation |
---|---|
bin | 100001110001111011010… |
… | …111100011011111101001 |
3 | 22012220211000112120002001 |
4 | 201301323113203133221 |
5 | 301013112120041410 |
6 | 4534225304011001 |
7 | 326466161250205 |
oct | 41617327433751 |
9 | 8186730476061 |
10 | 2321352112105 |
11 | 815530827a24 |
12 | 315a88160a61 |
13 | 13ab96c20430 |
14 | 804d56c1b05 |
15 | 405b4e8d33a |
hex | 21c7b5e37e9 |
2321352112105 has 8 divisors (see below), whose sum is σ = 2999901191112. Its totient is φ = 1714229251968.
The previous prime is 2321352112103. The next prime is 2321352112117. The reversal of 2321352112105 is 5012112531232.
It can be written as a sum of positive squares in 4 ways, for example, as 28538358489 + 2292813753616 = 168933^2 + 1514204^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2321352112105 - 21 = 2321352112103 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2321352112103) 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, 17856554644 + ... + 17856554773.
It is an arithmetic number, because the mean of its divisors is an integer number (374987648889).
Almost surely, 22321352112105 is an apocalyptic number.
It is an amenable number.
2321352112105 is a deficient number, since it is larger than the sum of its proper divisors (678549079007).
2321352112105 is a wasteful number, since it uses less digits than its factorization.
2321352112105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35713109435.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 2321352112105 its reverse (5012112531232), we get a palindrome (7333464643337).
The spelling of 2321352112105 in words is "two trillion, three hundred twenty-one billion, three hundred fifty-two million, one hundred twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •