13869
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21216
- Proper Divisor Sum (Aliquot Sum)
- 7347
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8712
- Möbius Function
- 0
- Radical
- 4623
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 151
- 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
- no
- Odd
- yes
Appears in sequences
- T(n+3,3) from table A045912 of characteristic polynomial of negative Pascal matrix.at n=3A006136
- Expansion of 1/Product_{m>=1} (1 - m*q^m)^18.at n=4A022742
- Triangle of coefficients of characteristic polynomial of negative Pascal matrix with (i,j)-th entry -C(i+j-2,i-1).at n=24A045912
- G.f.: (1 + Sum_{ i >= 0 } 2^i*x^(2^(i+1)-1)) / (1-x)^3.at n=46A063916
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=23A064201
- Smallest multiple of the n-th prime such that every partial sum is a square.at n=18A085039
- Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=16A124456
- Multiples of 23 whose digit reversal - 1 is also a multiple of 23.at n=24A166400
- Number of partitions p of n such that 3*min(p) + (number of parts of p) is not a part of p.at n=34A238543
- Number of partitions of n with difference 8 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=36A242699
- Numbers n such that n*2^2281 - 1 is prime.at n=10A265504
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 662", based on the 5-celled von Neumann neighborhood.at n=13A283602
- Column 3 of A060244.at n=27A291553
- Number of nX5 0..1 arrays with every element unequal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A316645
- Number of nX6 0..1 arrays with every element unequal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A316646
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=49A316648
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=50A316648
- Aggregate values of n-th stage of growth for two-dimensional cellular automaton defined by "Rule 614", based on the 5-celled von Neumann neighborhood, calculated via even-zeroing instead of mod 2.at n=15A323110
- Infinitary Ruth-Aaron numbers: numbers k such that A181894(k) = A181894(k+1).at n=14A330999
- Unitary Ruth-Aaron numbers: numbers k such that A008475(k) = A008475(k+1).at n=12A331000