Base | Representation |
---|---|
bin | 1100101011001… |
… | …10100100111001 |
3 | 21102001221022012 |
4 | 12111212210321 |
5 | 204204420304 |
6 | 14314535305 |
7 | 2430521204 |
oct | 625464471 |
9 | 242057265 |
10 | 106326329 |
11 | 550225aa |
12 | 2b737535 |
13 | 1904a1b5 |
14 | 1019a93b |
15 | 950416e |
hex | 6566939 |
106326329 has 2 divisors, whose sum is σ = 106326330. Its totient is φ = 106326328.
The previous prime is 106326323. The next prime is 106326331. The reversal of 106326329 is 923623601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79566400 + 26759929 = 8920^2 + 5173^2 .
It is a cyclic number.
It is not a de Polignac number, because 106326329 - 224 = 89549113 is a prime.
It is a super-2 number, since 2×1063263292 = 22610576477232482, which contains 22 as substring.
Together with 106326331, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 106326295 and 106326304.
It is not a weakly prime, because it can be changed into another prime (106326323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53163164 + 53163165.
It is an arithmetic number, because the mean of its divisors is an integer number (53163165).
Almost surely, 2106326329 is an apocalyptic number.
It is an amenable number.
106326329 is a deficient number, since it is larger than the sum of its proper divisors (1).
106326329 is an equidigital number, since it uses as much as digits as its factorization.
106326329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 32.
The square root of 106326329 is about 10311.4658996672. The cubic root of 106326329 is about 473.7475095420.
It can be divided in two parts, 10632 and 6329, that added together give a palindrome (16961).
The spelling of 106326329 in words is "one hundred six million, three hundred twenty-six thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •