14145
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 10047
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7040
- Möbius Function
- 1
- Radical
- 14145
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Powers of rooted tree enumerator.at n=19A000439
- a(n) = n*(n+4)*(n+5)/6.at n=41A005586
- Odd octagonal numbers: (2n+1)*(6n+1).at n=34A014641
- a(n) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=37A025219
- Partial sums of A048695.at n=9A048771
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).at n=33A068473
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=20A093058
- Primitive elements of A119432.at n=30A119433
- Expansion of 1 + Sum_{k>0} x^k^2/((1-x)(1-x^2)...(1-x^(2k))).at n=52A122129
- Odd integers that do not generate monotonically decreasing infinitary aliquot sequences.at n=32A127667
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=43A129936
- Numbers k such that k^6 - 2 and k^6 + 2 are both primes.at n=21A154938
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=23A166393
- Sum of all parts minus the total numbers of parts of all partitions of n.at n=21A196087
- Number of (n+1) X 5 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.at n=4A204709
- Number of (n+1) X 6 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.at n=3A204710
- T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.at n=31A204713
- T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.at n=32A204713
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.at n=6A270165
- Octagonal numbers (A000567) in which parity of digits alternates.at n=13A297647