Base | Representation |
---|---|
bin | 1100101101110… |
… | …01100000110001 |
3 | 21102201012021211 |
4 | 12112321200301 |
5 | 204301303113 |
6 | 14330120121 |
7 | 2433434455 |
oct | 626714061 |
9 | 242635254 |
10 | 106666033 |
11 | 55234851 |
12 | 2b880041 |
13 | 191389c6 |
14 | 10248665 |
15 | 956eb3d |
hex | 65b9831 |
106666033 has 2 divisors, whose sum is σ = 106666034. Its totient is φ = 106666032.
The previous prime is 106666013. The next prime is 106666099. The reversal of 106666033 is 330666601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98069409 + 8596624 = 9903^2 + 2932^2 .
It is an emirp because it is prime and its reverse (330666601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106666033 - 213 = 106657841 is a prime.
It is a super-2 number, since 2×1066660332 = 22755285191914178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106665986 and 106666004.
It is not a weakly prime, because it can be changed into another prime (106666013) 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, 53333016 + 53333017.
It is an arithmetic number, because the mean of its divisors is an integer number (53333017).
Almost surely, 2106666033 is an apocalyptic number.
It is an amenable number.
106666033 is a deficient number, since it is larger than the sum of its proper divisors (1).
106666033 is an equidigital number, since it uses as much as digits as its factorization.
106666033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The square root of 106666033 is about 10327.9249125853. The cubic root of 106666033 is about 474.2515014782.
The spelling of 106666033 in words is "one hundred six million, six hundred sixty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •