Base | Representation |
---|---|
bin | 1100101111000… |
… | …00011001110111 |
3 | 21110000021210220 |
4 | 12113200121313 |
5 | 204321402320 |
6 | 14333345423 |
7 | 2435000061 |
oct | 627403167 |
9 | 243007726 |
10 | 106825335 |
11 | 55333501 |
12 | 2b938273 |
13 | 19193376 |
14 | 1028a731 |
15 | 95a1e40 |
hex | 65e0677 |
106825335 has 32 divisors (see below), whose sum is σ = 174744768. Its totient is φ = 55710720.
The previous prime is 106825333. The next prime is 106825337. The reversal of 106825335 is 533528601.
It is an interprime number because it is at equal distance from previous prime (106825333) and next prime (106825337).
It is not a de Polignac number, because 106825335 - 21 = 106825333 is a prime.
It is a super-2 number, since 2×1068253352 = 22823304395724450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106825296 and 106825305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106825333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 286209 + ... + 286581.
It is an arithmetic number, because the mean of its divisors is an integer number (5460774).
Almost surely, 2106825335 is an apocalyptic number.
106825335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106825335 is a deficient number, since it is larger than the sum of its proper divisors (67919433).
106825335 is a wasteful number, since it uses less digits than its factorization.
106825335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 106825335 is about 10335.6342330793. The cubic root of 106825335 is about 474.4874767357.
The spelling of 106825335 in words is "one hundred six million, eight hundred twenty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •