13927
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14680
- Proper Divisor Sum (Aliquot Sum)
- 753
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13176
- Möbius Function
- 1
- Radical
- 13927
- 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
- 63
- 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
- Replace n with concatenation of its divisors.at n=26A037278
- Replace n with concatenation of its odd divisors.at n=26A037283
- Replace 2n+1 with concatenation of its divisors.at n=13A037286
- Concatenation of 3^k, k = 0,..,n.at n=3A051639
- Numbers n > 13 such that x^n + x^13 + x^12 + x^11 + x^10 + x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=39A057489
- Number of base 7 circular n-digit numbers with adjacent digits differing by 5 or less.at n=5A125370
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149443
- Diagonal sum of generalized Lucas-Pascal triangle;(11*10^n,1).at n=8A164852
- Nonprime concatenations of divisors of some k, ordered by k.at n=21A176556
- (A178476(n)-3)/9.at n=12A178486
- Ludic recurrence: Iterates of f(n) = A003309(n+1) starting from n=1.at n=8A255420
- Number of starting positions of Kayles with n pieces such that the 2nd player can win (P-positions).at n=46A263453
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 611", based on the 5-celled von Neumann neighborhood.at n=22A273214
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.at n=10A303806
- Indices of records in A305382.at n=15A306035
- Index of first occurrence of n in A305382.at n=22A316226
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.at n=41A324244
- The number of flips to go from Hamiltonian cycle alpha_n to beta_n in the Cameron graph of size n using Thomason's algorithm.at n=5A332750
- a(n) is the least number k such that A066323(k) = n.at n=22A342728
- Semiprimes of the form k^2 + 3.at n=27A360740