14095
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16920
- Proper Divisor Sum (Aliquot Sum)
- 2825
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11272
- Möbius Function
- 1
- Radical
- 14095
- 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
- 107
- 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
- Expansion of 1/((1-5x)(1-8x)(1-10x)(1-12x)).at n=3A028194
- Reversion of Moebius function A008683.at n=8A050385
- a(n) = floor(11^n/8^n).at n=30A094995
- a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7)+a(n-8).at n=25A109539
- 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, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=10A148235
- a(n) = 10^n+8^n-1.at n=4A155664
- Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 7.at n=23A244536
- a(n) = sum of all divisors of all positive integers <= prime(n).at n=31A244583
- Expansion of Product_{k>=1} 1/(1 - (5*k-4)*x^(5*k-4)).at n=31A265834
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 673", based on the 5-celled von Neumann neighborhood.at n=21A273406
- Numbers k such that k!6 - 48 is prime, where k!6 is the sextuple factorial number (A085158).at n=27A289701
- Number of disjoint covering systems of cardinality n.at n=8A296195
- Triangle read by rows: T(n,k) is the number of n X n binary matrices with k=0..n^2 ones forming a polyomino, under action of dihedral group of the square D_4.at n=54A331462