Base | Representation |
---|---|
bin | 1100100010101… |
… | …00001111100101 |
3 | 21022221211220212 |
4 | 12101110033211 |
5 | 203412441121 |
6 | 14234505205 |
7 | 2415131204 |
oct | 621241745 |
9 | 238854825 |
10 | 105202661 |
11 | 54425353 |
12 | 2b295205 |
13 | 18a458c5 |
14 | dd8723b |
15 | 938125b |
hex | 64543e5 |
105202661 has 8 divisors (see below), whose sum is σ = 106548504. Its totient is φ = 103864320.
The previous prime is 105202649. The next prime is 105202733. The reversal of 105202661 is 166202501.
It can be written as a sum of positive squares in 4 ways, for example, as 37636 + 105165025 = 194^2 + 10255^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 105202661 - 222 = 101008357 is a prime.
It is a super-2 number, since 2×1052026612 = 22135199762961842, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105202631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29621 + ... + 32981.
It is an arithmetic number, because the mean of its divisors is an integer number (13318563).
Almost surely, 2105202661 is an apocalyptic number.
It is an amenable number.
105202661 is a deficient number, since it is larger than the sum of its proper divisors (1345843).
105202661 is a wasteful number, since it uses less digits than its factorization.
105202661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3751.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 105202661 is about 10256.8348431668. The cubic root of 105202661 is about 472.0727244186.
The spelling of 105202661 in words is "one hundred five million, two hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •