13897
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14980
- Proper Divisor Sum (Aliquot Sum)
- 1083
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12816
- Möbius Function
- 1
- Radical
- 13897
- 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
- 138
- 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
- Sum of 12 nonzero 8th powers.at n=28A003390
- a(n) = n^3 + 3*n + 1.at n=24A005491
- Strong pseudoprimes to base 34.at n=10A020260
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=33A024972
- Gaps of 9 in sequence A038593 (upper terms).at n=9A038658
- Structured disdyakis dodecahedral numbers (vertex structure 7).at n=12A100162
- Table of number of domino tilings of generalized Aztec pillows of type (1, ..., 1, 3, 1, ..., 1)_n.at n=32A112830
- Square array of numbers A(n,k) (n>=0, k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= k for all x, read by antidiagonals.at n=48A135302
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUDU's starting at level 1.at n=59A135333
- Number of binary strings of length n with no substrings equal to 0001 1011 or 1100.at n=17A164489
- Parameters n for which the elliptic curve y^2=x^3+n has rank 4.at n=16A179124
- Ceiling((n+1/n)^3).at n=23A197773
- Number of 0..4 arrays x(0..n-1) of n elements with zero n-1st difference.at n=9A200150
- Number of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= 3 for all x.at n=6A210911
- a(n) = ceiling( Pi^(n/3) ).at n=24A212463
- Numbers missing from A001033 despite satisfying the necessary congruence conditions (see comments).at n=15A274470
- Numbers k such that k divides the number of planar partitions of k (A000219).at n=9A294086
- a(n) = a(n-1) + a(n-2) + a([n/3]) + a([2n/3]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=17A298344
- Expansion of Product_{k>=1} (1 - x^k)^A000593(k).at n=34A316366
- a(n) is the number of tilings of a bracelet of length 2n with 1 color of 5-minoes and 6-minoes, 2 colors of 7-minoes and 8-minoes, 3 colors of 9-minoes and 10-minoes, and so on.at n=12A334047