14060
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31920
- Proper Divisor Sum (Aliquot Sum)
- 17860
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 7030
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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
- Number of ways of folding a strip of n labeled stamps.at n=9A000136
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.at n=31A065255
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=9A084276
- Expansion of g.f.: (1+2*x^3+2*x^6)/((1-x)*(1-x-x^2+x^3-x^4-x^5+x^6)).at n=19A084683
- Number of patterns of n-rows in 12-tone music.at n=4A099031
- a(n) = (3+n)*(2 + 33*n + n^2)/6.at n=34A101860
- a(n) = 10*n*(n+1).at n=37A163761
- Minimum positive integer solution x of equation n=x*(x+1)/(t*(t+1)); that is, ratio of product of two consecutive integers divided by product of two consecutive integers. Here n is a nonsquare integer (see A000037).at n=65A166477
- (A178476(n)-3)/9.at n=23A178486
- Floor(1/{(5+n^4)^(1/4)}), where {}=fractional part.at n=25A184629
- Erroneous version of A000136.at n=9A195645
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4.at n=28A209988
- Principal diagonal of the convolution array A213819.at n=18A213820
- Primitive triangle numbers as defined in A218243.at n=28A218392
- Let p = prime(n). Smallest j such that q = j*2*p^3-1, r = j*p*2*q^2-1, s = j*p*2*r^2-1, and j*p*2*s^2-1 are prime numbers.at n=38A224612
- a(n) = n*(21*n-17)/2.at n=37A226491
- Number of length n 0..1 arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=13A244825
- Central nonzero values of A231599.at n=16A269298
- Number of pairs of orientable necklaces with n beads and up to 4 colors; i.e., turning the necklace over does not leave it unchanged. The turned-over necklace is not included in the count.at n=9A278640
- a(1) = 1; for n > 1, a(n) = prime(A101296(n)-1) * a(floor(n/2)).at n=59A292258