14315
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19680
- Proper Divisor Sum (Aliquot Sum)
- 5365
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9792
- Möbius Function
- -1
- Radical
- 14315
- 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
- 50
- 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
- Pseudoprimes to base 6.at n=32A005937
- a(n) = (n^3 + 2*n)/3.at n=35A006527
- Coordination sequence for MgZn2, Mg position.at n=30A009939
- Pseudoprimes to base 69.at n=41A020197
- Strong pseudoprimes to base 36.at n=19A020262
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=36A024599
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=38A025193
- a(n) = (2*n+1)*(4*n^2+4*n+3)/3.at n=17A057813
- Numbers k such that k!! + 2^7 is prime.at n=19A076194
- a(n) = min{ m : sum_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i).at n=20A092325
- Number of cubes that can be formed from the points of a cubical grid of n X n X n points.at n=13A098928
- k's first occurrence in A102932.at n=43A101255
- Digital sum of the 2^n-th partition number.at n=23A129491
- Number of ways to partition a 2*n X 2 grid into 4 connected equal-area regions.at n=34A167238
- One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n^2+2n+3)/3.at n=34A167875
- a(n) = n*(n+1)*(2*n+1)/6 - n*floor(n/2).at n=34A178946
- Positive integers of the form (6*m^2 + 1)/11.at n=29A179337
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order.at n=11A227675
- 26-gonal numbers: a(n) = n*(12*n-11).at n=35A255185
- Number of (n + 1, n + 2)-core partitions with odd parts and corresponding order ideals confined to the three outermost diagonals of P_{n + 1, n + 2}.at n=13A299102