13946
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22080
- Proper Divisor Sum (Aliquot Sum)
- 8134
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6588
- Möbius Function
- -1
- Radical
- 13946
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=21A000098
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], where T is the array in A026386.at n=17A026397
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)).at n=51A097860
- Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) + 17 for n > 0.at n=9A101539
- a(n) = prime(1^3) + prime(2^3) + prime(3^3) + ... + prime(n^3).at n=8A109789
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=39A131367
- a(0)=1; thereafter a(n)=a(n-1)+a([n/Phi]), where Phi=(1+sqrt(5))/2, the golden ratio.at n=40A131882
- Sum of the numbers already killed in the first jump of a Sieve of Eratosthenes table.at n=27A179628
- LAN party numbers.at n=10A196570
- Sum of the entries of the table of marks of the alternating group.at n=7A218918
- Number of tilings of a 4 X n rectangle using L and T tetrominoes.at n=12A233191
- Number of partitions of n not having depth 1; see Comments.at n=39A238003
- Total number of points on a sphere when both poles are on an x by x grid where x=8*n+1.at n=41A254527
- Number of length-n 0..3 arrays with no repeated value differing from the previous repeated value by one.at n=6A269489
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one.at n=42A269494
- Number of length-7 0..n arrays with no repeated value differing from the previous repeated value by one.at n=2A269498
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by more than one.at n=42A269583
- Number of length-7 0..n arrays with no repeated value differing from the previous repeated value by more than one.at n=2A269587