13659
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18960
- Proper Divisor Sum (Aliquot Sum)
- 5301
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8736
- Möbius Function
- -1
- Radical
- 13659
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k and 7*k are anagrams.at n=10A023091
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=14A031785
- Smallest number that takes n steps to reach 0 under "k->min product of 2 numbers whose concatenation is k".at n=11A035933
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=13A045262
- Inverse Moebius transform of A000011 (starting at term 0).at n=20A054181
- a(n) = floor((n+2)^(n+2)/n^n).at n=42A078111
- Numbers m such that m! + p is a prime, where p is the smallest prime > m.at n=25A084749
- Numbers n such that (14^n-1)^2-2 is prime.at n=8A100905
- Number of (n+2)X3 0..2 arrays with each 3X3 subblock having rows and columns in lexicographically nondecreasing order.at n=2A185469
- Number of (n+2)X5 0..2 arrays with each 3X3 subblock having rows and columns in lexicographically nondecreasing order.at n=0A185471
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having rows and columns in lexicographically nondecreasing order.at n=3A185477
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock having rows and columns in lexicographically nondecreasing order.at n=5A185477
- Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.at n=14A241883
- Numbers x whose digits can be permuted to produce a multiple of x.at n=23A245680
- a(n) = greatest k such that A155043(k+A262509(n)) < A155043(A262509(n)).at n=50A262909
- a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).at n=30A304375