14267
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15576
- Proper Divisor Sum (Aliquot Sum)
- 1309
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12960
- Möbius Function
- 1
- Radical
- 14267
- 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(a(2i-1)*a(n-2i+1), i = 1,2,...,[ (n+2)/4 ]).at n=23A024965
- Base-9 palindromes that start with 2.at n=34A043029
- Number of cycle types of direct products of two degree-n permutations.at n=15A053391
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=39A127485
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2 = A127483(k+3) - 3.at n=3A127486
- Square spiral of sums of selected preceding terms, starting at 1.at n=38A141481
- a(n) = 81*n^2 - 118*n + 43.at n=14A156677
- a(n) = smallest number m such that m^2 and n^2 share no common digits and m^2 and n^2 together use all 10 digits, a(n) = 0 if no such m exists.at n=3A158931
- a(n+1) = a(n) + floor(a(n)/6) with a(0) = 6.at n=53A182307
- a(n) is the numerator of the probability that the free polyomino with binary code A246521(n+1) appears in a version of the Eden growth model on the square lattice, when n square cells have been added.at n=54A367671
- a(n) is the numerator of the probability that a particular one of the A335573(n+1) fixed polyominoes corresponding to the free polyomino with binary code A246521(n+1) appears in the version of the Eden growth model described in A367671 when n square cells have been added.at n=54A367675