Base | Representation |
---|---|
bin | 1100101101101… |
… | …10011000100111 |
3 | 21102200112201101 |
4 | 12112312120213 |
5 | 204300400343 |
6 | 14325540531 |
7 | 2433352225 |
oct | 626663047 |
9 | 242615641 |
10 | 106653223 |
11 | 55226166 |
12 | 2b874747 |
13 | 19132c21 |
14 | 10243b15 |
15 | 956ae4d |
hex | 65b6627 |
106653223 has 8 divisors (see below), whose sum is σ = 113067792. Its totient is φ = 100254336.
The previous prime is 106653221. The next prime is 106653227. The reversal of 106653223 is 322356601.
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 106653223 - 21 = 106653221 is a prime.
It is a super-2 number, since 2×1066532232 = 22749819952575458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106653191 and 106653200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106653221) 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, 11961 + ... + 18877.
It is an arithmetic number, because the mean of its divisors is an integer number (14133474).
Almost surely, 2106653223 is an apocalyptic number.
106653223 is a deficient number, since it is larger than the sum of its proper divisors (6414569).
106653223 is an equidigital number, since it uses as much as digits as its factorization.
106653223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7841.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 106653223 is about 10327.3047306642. The cubic root of 106653223 is about 474.2325157249.
It can be divided in two parts, 1066 and 53223, that added together give a square (54289 = 2332).
The spelling of 106653223 in words is "one hundred six million, six hundred fifty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •