13852
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 24248
- Proper Divisor Sum (Aliquot Sum)
- 10396
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6924
- Möbius Function
- 0
- Radical
- 6926
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/(1-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18).at n=60A017876
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-8).at n=22A023438
- a(n) = (d(n)-r(n))/2, where d = A026043 and r is the periodic sequence with fundamental period (1,1,0,0).at n=40A026044
- Numbers having four 4's in base 6.at n=33A043388
- Numbers k such that k^8 == 1 (mod 9^3).at n=38A056084
- a(n) = 729*n + 1.at n=18A158397
- n^3 + n-th cubefree number.at n=23A180499
- Fibonacci sequence beginning 13, 6.at n=16A206612
- Number of nX3 0..1 arrays with no more than floor(nX3/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=7A222536
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=52A222541
- Number of simple connected graphs with n nodes that are bipartite and planar.at n=10A243321
- a(n) = 54*2^n + 28 (n >= 1).at n=7A304606
- Number of separable partitions of n that consist of an odd number of parts.at n=39A325724
- T(n,m) is the numerator of the resistance between two nodes located at the end of a side of length n of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a square array read by descending antidiagonals.at n=31A357115
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=33A377037
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=35A377037
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=37A377037
- Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.at n=39A377037
- Number of weak compositions of n such that the set of adjacent differences is a subset of {-1,1}.at n=21A383620