Base | Representation |
---|---|
bin | 1100100001100… |
… | …10111011011101 |
3 | 21022200220201221 |
4 | 12100302323131 |
5 | 203344104310 |
6 | 14231533341 |
7 | 2414022316 |
oct | 620627335 |
9 | 238626657 |
10 | 105066205 |
11 | 54341882 |
12 | 2b22a251 |
13 | 189c876a |
14 | dd4d60d |
15 | 9355ada |
hex | 6432edd |
105066205 has 8 divisors (see below), whose sum is σ = 133495992. Its totient is φ = 79108608.
The previous prime is 105066179. The next prime is 105066209. The reversal of 105066205 is 502660501.
It can be written as a sum of positive squares in 4 ways, for example, as 16216729 + 88849476 = 4027^2 + 9426^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 105066205 - 217 = 104935133 is a prime.
It is a super-2 number, since 2×1050662052 = 22077814866204050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105066205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105066209) 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, 617952 + ... + 618121.
It is an arithmetic number, because the mean of its divisors is an integer number (16686999).
Almost surely, 2105066205 is an apocalyptic number.
It is an amenable number.
105066205 is a deficient number, since it is larger than the sum of its proper divisors (28429787).
105066205 is a wasteful number, since it uses less digits than its factorization.
105066205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236095.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 105066205 is about 10250.1807301140. The cubic root of 105066205 is about 471.8685311453.
The spelling of 105066205 in words is "one hundred five million, sixty-six thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •