14305
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
- 4
- Divisor Sum
- 17172
- Proper Divisor Sum (Aliquot Sum)
- 2867
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11440
- Möbius Function
- 1
- Radical
- 14305
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=a(1)=a(2)=1.at n=17A049864
- Numbers k such that 7*2^k - 3 is prime.at n=32A058593
- Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).at n=26A076660
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k >= 0).at n=41A118890
- Number of compositions of n such that every part divides the largest part.at n=17A130708
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 0), (1, -1, 0), (1, 0, -1), (1, 0, 0)}.at n=9A148730
- Number of lines through at least 2 points of a 10 X n grid of points.at n=25A160850
- a(n) = 2^(prime(n)-1) mod prime(n)^2.at n=34A196202
- Number of zero-sum nX1 -3..3 arrays with every element equal to at least one horizontal or vertical neighbor.at n=11A202130
- Number of (n+2) X 4 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=8A202455
- Beach-Williams Pell numbers of type pq (p,q primes).at n=12A212078
- a(n) = (A216363(n) - 1)/118.at n=28A216380
- 10-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0,0.at n=24A251765
- Number of nX2 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A318010
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=37A318016
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=43A318016
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=37A320402
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=43A320402
- Partition the decimal expansion of Pi into non-overlapping strings of length 10: 3141592653, 5897932384,..; a(n) is the position of the strings where digits are different from each other.at n=5A329368
- Number of ways to write n as an ordered sum of 5 prime powers (including 1).at n=34A341134