Base | Representation |
---|---|
bin | 1100100001010… |
… | …11101101110101 |
3 | 21022122102012201 |
4 | 12100223231311 |
5 | 203342133121 |
6 | 14231144501 |
7 | 2413540222 |
oct | 620535565 |
9 | 238572181 |
10 | 105036661 |
11 | 54321664 |
12 | 2b215131 |
13 | 189b8192 |
14 | dd42949 |
15 | 934be91 |
hex | 642bb75 |
105036661 has 2 divisors, whose sum is σ = 105036662. Its totient is φ = 105036660.
The previous prime is 105036641. The next prime is 105036689. The reversal of 105036661 is 166630501.
It is an a-pointer prime, because the next prime (105036689) can be obtained adding 105036661 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104162436 + 874225 = 10206^2 + 935^2 .
It is a cyclic number.
It is not a de Polignac number, because 105036661 - 223 = 96648053 is a prime.
It is a super-2 number, since 2×1050366612 = 22065400308057842, which contains 22 as substring.
It is equal to p6034663 and since 105036661 and 6034663 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105036641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52518330 + 52518331.
It is an arithmetic number, because the mean of its divisors is an integer number (52518331).
Almost surely, 2105036661 is an apocalyptic number.
It is an amenable number.
105036661 is a deficient number, since it is larger than the sum of its proper divisors (1).
105036661 is an equidigital number, since it uses as much as digits as its factorization.
105036661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 105036661 is about 10248.7394834682. The cubic root of 105036661 is about 471.8242981122.
The spelling of 105036661 in words is "one hundred five million, thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •