14152
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27900
- Proper Divisor Sum (Aliquot Sum)
- 13748
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 3538
- Omega Function (Ω)
- 5
- 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
- 58
- 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
- Sum of 12 nonzero 8th powers.at n=29A003390
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 59.at n=32A031557
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=39A059954
- A014486-encodings of trivalent plane trees (tpt) represented as (embedded into) a subset of general plane trees.at n=5A083936
- a(n) = A130179(n)/81.at n=18A130085
- G.f. satisfies: x = A( x + A(x)^2 ).at n=6A139702
- a(n) = 4*(4 + 9*n^2 + 15*n).at n=19A144449
- a(n) = Sum_{k=0..n} C(n,k)^(k+1).at n=5A184731
- Sophie Germain 5-almost primes.at n=25A211162
- G.f. A(x) satisfies A( x - A(x)^2 ) = x.at n=6A213591
- Number of tilings of a 9 X n rectangle using integer-sided square tiles of area > 1.at n=18A226373
- Number of partitions of n into distinct parts with boundary size 6.at n=46A227563
- Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right.at n=23A297627
- Denominators of (1/8)*n*(5 + 3*n)/((1 + 3*n)*(4 + 3*n)), n >= 0.at n=19A300297
- Triangle T(n,k) read by rows: T(n,k) = number of ways of seating n people around a table for the second time so that k pairs are maintained. Rotated sequences are counted as one.at n=60A326404
- Sum of all the parts in the partitions of n into 9 parts.at n=29A326464
- Number of Lyndon compositions of n that are not weakly increasing.at n=17A329141
- a(1) = a(2) = 1; a(n+2) = 1 + Sum_{d|n} a(n/d) * a(d).at n=26A346116
- Expansion of e.g.f. 1/(1 - Sum_{k>=1} mu(k) * x^k/k!), where mu() is the Moebius function (A008683).at n=8A352869
- Cycle lengths obtained by repeated application of the distance-minimizing variant of the strip bijection for the square lattice described in A367150.at n=25A367146