13950
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 38688
- Proper Divisor Sum (Aliquot Sum)
- 24738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 930
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.at n=30A002411
- Even heptagonal numbers (A000566).at n=37A014640
- Even pentagonal pyramidal numbers.at n=22A015224
- a(n) = n*(29*n + 1)/2.at n=31A022287
- a(n) = (2*n + 1)*(5*n + 1).at n=37A033571
- Concatenate n-th prime and n-th composite.at n=33A038530
- Number of primitive (period n) step cyclic shifted sequences using a maximum of five different symbols.at n=7A056422
- a(n) = 4n^3 + 2n^2.at n=14A089207
- Heptagonal numbers for which the sum of the digits is also a heptagonal number.at n=19A117650
- Triangle, read by rows, defined by T(n,k) = T(n-1,k) + T(n,k-1) for nk>0, where T(n,0) = T(n-1,0) + T(n-1,n-1) and T(n,n) = T(n,n-1) for n>0 with T(0,0)=1.at n=39A129577
- a(n) = the smallest multiple of the n-th prime such that (a(n)-1) is divisible by both the (n-1)th prime and the (n+1)st prime.at n=9A143244
- Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=7A144563
- The sum of all the entries in an n X n Cayley table for multiplication in Z_n.at n=30A160255
- Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=40A161129
- Partial sums of Sum_{k=1..n} n/gcd(n,k), or partial sums of Sum_{d|n} d*phi(d) (see A057660).at n=37A174405
- Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=7A207046
- Integer areas of incentral triangles of integer-sided triangles.at n=35A227879
- Number of partitions of n with difference 2 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=41A242693
- Inverse Moebius transform of Pell numbers.at n=11A256281
- Triangle read by rows: T(n, k) = Sum_{t=k..n-3} (-1)^(t-k)*(n-t)!*binomial(t,k)*binomial(n-3,t).at n=16A264028