13266
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31824
- Proper Divisor Sum (Aliquot Sum)
- 18558
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3960
- Möbius Function
- 0
- Radical
- 4422
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns.at n=29A034337
- 23-gonal numbers: a(n) = n(21n-19)/2.at n=36A051875
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the group sum divided by n for the n-th group.at n=44A074131
- Partial sums of A084263.at n=42A084570
- Numbers n such that A001414(n) = sum of squared digits of n.at n=23A094908
- Numbers k such that the k-th triangular number contains only digits {0,1,8}.at n=12A119046
- a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even.at n=42A135301
- Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps).at n=42A158022
- Row sums of A163233 and A163235.at n=27A163242
- Numbers k such that 6*prime(k) -+ {1,5} are all prime.at n=22A174393
- a(n) = Sum_{k=1..n} k*k', where n' is the arithmetic derivative of n.at n=36A190117
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.at n=20A208598
- Number of 0..n arrays of length 7 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=9A221686
- Number of (n+1)X(2+1) 0..3 arrays x(i,j) with row sums sum{j*x(i,j), j=1..2+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=1A232679
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=4A232680
- Numbers n such that n^3+prime(n) and n^3-prime(n) are prime.at n=31A257788
- Number of length-4 0..n arrays with no following elements larger than the first repeated value.at n=9A267472
- Number of 4-orbits of the cyclic group C_4 for a bi-colored square n X n grid with n squares of one color.at n=4A276452
- Expansion of Product_{k>=1} (1 - x^(12*k)) * (1 - x^(4*k-2)) / (1 - x^k).at n=48A280949
- p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)(1 - S^2).at n=20A291740