14502
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29016
- Proper Divisor Sum (Aliquot Sum)
- 14514
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4832
- Möbius Function
- -1
- Radical
- 14502
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 71
- 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
- yes
- Odd
- no
Appears in sequences
- Number of prime unlabeled connected T_0 topologies (i.e., prime T_0 connected homeomorphism classes) on n points.at n=6A028858
- Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct path lengths.at n=14A030077
- a(n) is the smallest index m such that Sum_{k=2..m} 1/PrimePi(k) >= n, where PrimePi()=A000720().at n=40A074633
- Number of partitions of n into nonsquares.at n=53A087153
- Numbers whose square is a permutational number A134640.at n=39A134742
- Binomial transform of [1, 4, 6, 4, 1, 1, -1, 1, -1, 1, ...].at n=20A140227
- Number of steps between two valleys at height 0 in the infinite Dyck path in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1.at n=27A233968
- Number of 3-connected planar triangulations of the sphere with n vertices up to orientation preserving isomorphisms.at n=8A253882
- Fixed points of permutations A256210 and A256371.at n=17A256372
- Total length of self-avoiding walks with n bonds on the simple cubic lattice with additional bridges of length 1.at n=4A259817
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=28A270288
- Number of 5-cycles in the n-triangular honeycomb obtuse knight graph.at n=24A290391
- Number of nX4 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=5A296392
- Number of nX6 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=3A296394
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=39A296396
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=41A296396
- a(n) = 9*n^2 + 21*n - 6 (n>=1).at n=38A304374
- Triangle T(n,k) read by rows: fibonomial coefficients sums triangle.at n=39A305695
- Maximal permanent of an n X n Toeplitz matrix using the integers 1 to 2*n - 1.at n=4A350938
- Numbers k such that the decimal expansion of k and 14^k both begin with 14.at n=18A352239