14566
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21852
- Proper Divisor Sum (Aliquot Sum)
- 7286
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7282
- Möbius Function
- 1
- Radical
- 14566
- 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
- 120
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Number of ordered 5-tuples of integers from [ 1..n ] with no global factor.at n=15A015650
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=22A020437
- Alternating sum transform (PSumSIGN) of A000975.at n=14A034299
- Number of trees with n nodes and 4 leaves.at n=38A055291
- a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j).at n=52A057176
- Number of partitions of n having nonnegative even rank (the rank of a partition is the largest part minus the number of parts).at n=41A101709
- Pascal's triangle, but the last element of the row is the sum of all the previous terms.at n=52A135299
- Partial sums of A007583.at n=7A160156
- Numbers k such that 210*k+{11, 13, 17, 19, 23, 29} are 6 consecutive primes.at n=10A182282
- Number of partitions of n such that the number of parts and the greatest part are not coprime.at n=39A200792
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 822", based on the 5-celled von Neumann neighborhood.at n=29A272847
- Number of nX3 0..1 arrays with no 1 adjacent to 4 king-move neighboring 1s.at n=4A297097
- Number of nX5 0..1 arrays with no 1 adjacent to 4 king-move neighboring 1s.at n=2A297099
- T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 4 king-move neighboring 1s.at n=23A297102
- T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 4 king-move neighboring 1s.at n=25A297102
- Total sum of composite parts in all partitions of n.at n=24A326982
- Irregular triangle, read by rows, where row n lists composite numbers c such that c * sigma_n(c) == 2 (mod phi(c)) for n >= 0. Row lengths for n=0,1,... are given in A392307.at n=58A392306