Base | Representation |
---|---|
bin | 1100100101110… |
… | …00100110000101 |
3 | 21100201201202120 |
4 | 12102320212011 |
5 | 204014114301 |
6 | 14251400153 |
7 | 2421462444 |
oct | 622704605 |
9 | 240651676 |
10 | 105613701 |
11 | 54686156 |
12 | 2b453059 |
13 | 18b5aa1b |
14 | 10052d5b |
15 | 9412e36 |
hex | 64b8985 |
105613701 has 4 divisors (see below), whose sum is σ = 140818272. Its totient is φ = 70409132.
The previous prime is 105613693. The next prime is 105613709. The reversal of 105613701 is 107316501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (105613693) and next prime (105613709).
It is a cyclic number.
It is not a de Polignac number, because 105613701 - 23 = 105613693 is a prime.
It is a super-3 number, since 3×1056137013 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105613709) 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, 17602281 + ... + 17602286.
It is an arithmetic number, because the mean of its divisors is an integer number (35204568).
Almost surely, 2105613701 is an apocalyptic number.
It is an amenable number.
105613701 is a deficient number, since it is larger than the sum of its proper divisors (35204571).
105613701 is an equidigital number, since it uses as much as digits as its factorization.
105613701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35204570.
The product of its (nonzero) digits is 630, while the sum is 24.
The square root of 105613701 is about 10276.8526796875. The cubic root of 105613701 is about 472.6867412253.
The spelling of 105613701 in words is "one hundred five million, six hundred thirteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •