14607
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21680
- Proper Divisor Sum (Aliquot Sum)
- 7073
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 0
- Radical
- 1623
- Omega Function (Ω)
- 4
- 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
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Quadruples of different integers from [ 2,n ] with no common factors between pairs.at n=42A015628
- Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=17A075134
- Shadow of Euler's constant exp(1).at n=36A108912
- Number of base 17 n-digit numbers with adjacent digits differing by five or less.at n=4A126538
- Number of n X 6 0..4 arrays with each element equal to the number its horizontal and vertical neighbors within one of itself.at n=7A196015
- a(n) = 2^n - A210109(n).at n=15A210145
- G.f. satisfies: A(x) = 1 + x*A(x*A(x)^2)^3.at n=6A212030
- Number of inequivalent (mod D_4) ways to place 2 nonattacking knights on an n X n board.at n=20A243717
- Numbers n such that the sum of the digits of the numbers from 0 to n is a square.at n=46A271626
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 774", based on the 5-celled von Neumann neighborhood.at n=42A273504
- a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon).at n=21A335783
- Odd numbers k such that A173557(k) = A173557(sigma(k)), where A173557(n) is multiplicative with a(p^e) = p-1 and sigma is the sum of divisors function.at n=17A387159