14695
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 2945
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11752
- Möbius Function
- 1
- Radical
- 14695
- 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
- 270
- 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_{k=0..n} A047848(k, n-k).at n=8A047857
- Boris Stechkin's function.at n=32A055004
- S[A002808(n)] where S[] is Boris Stechkin's function (A055004) and A002808(n) are the composites.at n=21A063483
- (Sum of composites among next n numbers)-(sum of primes among next n numbers).at n=32A094338
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=30A131367
- a(n) = 15*n^2 + 9*n + 1.at n=31A134153
- Row sums of triangle A145367 (S1hat(-3)) and partition array A145366 (M31hat(-3)).at n=12A145368
- Expansion of (1+147*x+1230*x^2+1885*x^3+714*x^4+63*x^5+x^6)/(1-x)^7.at n=3A160840
- Numbers k such that 7*R_k - 60 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A256801
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by one.at n=5A269490
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one.at n=41A269494
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by one.at n=3A269497
- Semiprimes that are the sum of the first n odd primes for some n.at n=24A274182
- a(n) is (apparently) the largest number k whose Collatz (or '3x+1') trajectory includes the number k + n.at n=36A303876
- Number of equivalence classes, modulo transposition, of non-symmetric plane partitions of n.at n=18A306098
- G.f.: Product_{k>=1, j>=1} 1/((1 + x^(k*j)) * (1 - x^(k*j))^2).at n=17A320245
- Triangle read by rows: row n consists of the n numbers k such that A075254(k) = A346378(n).at n=48A360637
- Starts of runs of 3 consecutive integers that are Wythoff-Niven numbers (A364006).at n=6A364008