14350
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 16898
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 2870
- 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
- 76
- 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
- a(n) = prime(n)*prime(n-1) - 1.at n=30A023515
- a(n) = (d(n)-r(n))/2, where d = A026066 and r is the periodic sequence with fundamental period (1,0,0,0).at n=43A026067
- Otto Haxel's guess for magic numbers of nuclear shells.at n=35A033547
- T(n,n-3), array T as in A047150.at n=7A047155
- Integers i such that 41*i = 105 X i.at n=17A115876
- Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=8A144563
- If 0 <= n <= 3 then a(n) = n(n+1)(n+2)/3, if n >= 4 then a(n) = n(n^2+5)/3.at n=35A162626
- Number of geometrically distinct open knight's tours of a 3 X n chessboard.at n=8A169777
- n*(n^2-2*n-1).at n=24A214446
- Number of primes <= A214756(n).at n=14A214924
- Expansion of 1/(1 - x - x^5 + x^6 - x^7 - x^11 + x^12).at n=39A225500
- a(1)=1, a(2)=2; thereafter a(n) = a(n-1) + a(n-1-(number of even terms so far)) + a(n-1-(number of odd terms so far)).at n=40A249039
- Partial sums of A253088.at n=28A255048
- Numbers k such that (38*10^k + 637)/9 is prime.at n=27A271375
- Irregular triangle T(n,k) for 1 <= k <= n/2 + 1: T(n,k) = number of double palindrome structures of length n using exactly k different symbols.at n=58A284877
- Signed recurrence over binary strict trees: a(n) = 1 - Sum_{x + y = n, 0 < x < y < n} a(x) * a(y).at n=43A300866
- Number of prime parts in the partitions of n into 8 parts.at n=41A309437
- Two-column table read by rows: Primitive distinct pairs that have the same value of phi, sigma, and tau.at n=23A322688
- Number of double palindrome structures of length n using exactly four different symbols.at n=13A328690
- Number of ways to write n as an ordered sum of 7 primes (counting 1 as a prime).at n=20A341986