9853
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 227
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9628
- Möbius Function
- 1
- Radical
- 9853
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 210
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 39*2^k + 1 is prime.at n=35A002269
- Representation degeneracies for boson strings.at n=34A005291
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=31A031822
- Base-7 palindromes that start with 4.at n=21A043018
- Increasing partial quotients of the continued fraction for agm(1,i)/(1+i).at n=12A076392
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=42A086769
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=13A093058
- Numbers n such that the numbers of divisors of n,n+1,n+2 and n+3 are k,2k,4k,8k respectively for some k.at n=6A100364
- Iccanobirt numbers (15 of 15): a(n) = R(R(a(n-1)) + R(a(n-2)) + R(a(n-3))), where R is the digit reversal function A004086.at n=20A102125
- Iccanobirt semiprimes (15 of 15): Semiprime numbers in A102125.at n=4A102205
- Numbers j such that (3^j)*(47#) -1 is prime.at n=36A110116
- Ceiling(4*Pi*n^2).at n=27A135971
- Number of n X n binary arrays symmetric under 90-degree rotation with all ones connected only in a zee 1,1 1,2 2,2 2,3 in any orientation.at n=11A145958
- a(n) = floor((5^n)/(3^n - 2^n)).at n=17A191695
- Reversals of tribonacci numbers (sorted).at n=18A215649
- Values of n such that L(20) and N(20) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=23A227523
- Integers n such that appending some decimal digit to the first n digits of Pi results in a prime.at n=27A231336
- Number of partitions p of n such that (maximal multiplicity of the parts of p) > (number of distinct parts of p).at n=37A240309
- a(n) is the smallest number whose Collatz ('3x+1') trajectory crosses its initial value exactly n times.at n=49A301937
- Number of interior vertices formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) square grid.at n=13A331767