Base | Representation |
---|---|
bin | 1100100010101… |
… | …00110111011101 |
3 | 21022221222102101 |
4 | 12101110313131 |
5 | 203413031323 |
6 | 14234525101 |
7 | 2415141511 |
oct | 621246735 |
9 | 238858371 |
10 | 105205213 |
11 | 54427263 |
12 | 2b296791 |
13 | 18a46b09 |
14 | dd88141 |
15 | 9381dad |
hex | 6454ddd |
105205213 has 4 divisors (see below), whose sum is σ = 105241468. Its totient is φ = 105168960.
The previous prime is 105205211. The next prime is 105205237. The reversal of 105205213 is 312502501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25674489 + 79530724 = 5067^2 + 8918^2 .
It is a cyclic number.
It is not a de Polignac number, because 105205213 - 21 = 105205211 is a prime.
It is a super-2 number, since 2×1052052132 = 22136273684750738, 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 (105205211) 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, 13356 + ... + 19717.
It is an arithmetic number, because the mean of its divisors is an integer number (26310367).
Almost surely, 2105205213 is an apocalyptic number.
It is an amenable number.
105205213 is a deficient number, since it is larger than the sum of its proper divisors (36255).
105205213 is an equidigital number, since it uses as much as digits as its factorization.
105205213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36254.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 105205213 is about 10256.9592472623. The cubic root of 105205213 is about 472.0765415586.
Adding to 105205213 its reverse (312502501), we get a palindrome (417707714).
The spelling of 105205213 in words is "one hundred five million, two hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •