13730
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24732
- Proper Divisor Sum (Aliquot Sum)
- 11002
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5488
- Möbius Function
- -1
- Radical
- 13730
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 7.at n=39A031420
- Number of connected functions of n points with no symmetries.at n=13A032175
- Number of step cyclic shifted sequence structures using exactly four different symbols.at n=11A056436
- Numbers whose square is the sum of distinct double factorials (A006882).at n=49A115649
- Number of partitions of n such that the largest part and the smallest part are relatively prime.at n=34A117087
- a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime.at n=28A152530
- a(n) = A030068(4n+1).at n=44A169739
- Total Wiener index of star-like trees with n edges.at n=11A186310
- Number of 0..n arrays of length 3 with 0 never adjacent to n.at n=22A212836
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=39A229467
- Number of permutations of [n] avoiding {1234, 1324, 2341}.at n=9A294823
- G.f. A(x) satisfies: A(x) = x*exp(Sum_{n>=1} Sum_{k>=1} (-1)^(k+1)*n^k*a(n)^k*x^(n*k)/k).at n=8A307725
- a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = abs(i - j) if min(i, j) < max(i, j) <= 2*min(i, j), and otherwise 0.at n=6A357420
- Number of (curved) edges after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.at n=4A359571