Base | Representation |
---|---|
bin | 1100101001100… |
… | …10100011000111 |
3 | 21101200002222101 |
4 | 12110302203013 |
5 | 204131110343 |
6 | 14310212531 |
7 | 2425642666 |
oct | 624624307 |
9 | 241602871 |
10 | 106113223 |
11 | 54997487 |
12 | 2b654147 |
13 | 18ca41b8 |
14 | 10142ddd |
15 | 94b0e4d |
hex | 65328c7 |
106113223 has 2 divisors, whose sum is σ = 106113224. Its totient is φ = 106113222.
The previous prime is 106113209. The next prime is 106113229. The reversal of 106113223 is 322311601.
It is a strong prime.
It is an emirp because it is prime and its reverse (322311601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106113223 - 225 = 72558791 is a prime.
It is a super-2 number, since 2×1061132232 = 22520032190895458, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106113223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106113229) 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 as a sum of consecutive naturals, namely, 53056611 + 53056612.
It is an arithmetic number, because the mean of its divisors is an integer number (53056612).
Almost surely, 2106113223 is an apocalyptic number.
106113223 is a deficient number, since it is larger than the sum of its proper divisors (1).
106113223 is an equidigital number, since it uses as much as digits as its factorization.
106113223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 106113223 is about 10301.1272684110. The cubic root of 106113223 is about 473.4307928766.
Adding to 106113223 its reverse (322311601), we get a palindrome (428424824).
The spelling of 106113223 in words is "one hundred six million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •