13683
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18248
- Proper Divisor Sum (Aliquot Sum)
- 4565
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9120
- Möbius Function
- 1
- Radical
- 13683
- 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
- 58
- 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
- Number of base 13 circular n-digit numbers with adjacent digits differing by 3 or less.at n=5A125323
- 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, -1, 0), (-1, 1, -1), (0, 0, 1), (1, 0, -1)}.at n=12A148000
- a(n) = 7^n - 5^n + 1^n.at n=5A155640
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 3] as of [2, 3, 1].at n=9A211301
- Number of n X n 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=2A224275
- Number of nX3 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=2A224276
- T(n,k)=Number of nXk 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=12A224281
- Number of 3Xn 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=2A224282
- Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i*j*k| <= n and gcd(i,j,k) <= 1.at n=38A226357
- Numbers k such that (16*10^k + 197) / 3 is prime.at n=20A280205
- Number of multisets of exactly four partitions of positive integers into distinct parts with total sum of parts equal to n.at n=20A320789
- Number of tilings of an 8 X n rectangle using 2*n copies of the disconnected shape [oo__oo].at n=18A323352
- Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).at n=45A339072
- Consecutive states of the linear congruential pseudo-random number generator (1541*s + 2957) mod 14000 when started at s=1.at n=6A385336