Base | Representation |
---|---|
bin | 1100100101010… |
… | …10110011011101 |
3 | 21100121212021102 |
4 | 12102222303131 |
5 | 204010312323 |
6 | 14250242445 |
7 | 2421135656 |
oct | 622526335 |
9 | 240555242 |
10 | 105557213 |
11 | 54647773 |
12 | 2b426425 |
13 | 18b3b0b8 |
14 | 1003a52d |
15 | 9401328 |
hex | 64aacdd |
105557213 has 2 divisors, whose sum is σ = 105557214. Its totient is φ = 105557212.
The previous prime is 105557167. The next prime is 105557219. The reversal of 105557213 is 312755501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105411289 + 145924 = 10267^2 + 382^2 .
It is a cyclic number.
It is not a de Polignac number, because 105557213 - 210 = 105556189 is a prime.
It is a super-2 number, since 2×1055572132 = 22284650432654738, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p6062825 and since 105557213 and 6062825 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 (105557219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52778606 + 52778607.
It is an arithmetic number, because the mean of its divisors is an integer number (52778607).
Almost surely, 2105557213 is an apocalyptic number.
It is an amenable number.
105557213 is a deficient number, since it is larger than the sum of its proper divisors (1).
105557213 is an equidigital number, since it uses as much as digits as its factorization.
105557213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 105557213 is about 10274.1039998630. The cubic root of 105557213 is about 472.6024532645.
The spelling of 105557213 in words is "one hundred five million, five hundred fifty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •