14689
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15124
- Proper Divisor Sum (Aliquot Sum)
- 435
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14256
- Möbius Function
- 1
- Radical
- 14689
- 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
- 164
- 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
- Pseudoprimes to base 14.at n=40A020142
- Pseudoprimes to base 35.at n=31A020163
- Pseudoprimes to base 63.at n=32A020191
- Pseudoprimes to base 79.at n=44A020207
- Strong pseudoprimes to base 34.at n=12A020260
- Strong pseudoprimes to base 85.at n=12A020311
- Strong pseudoprimes to base 88.at n=12A020314
- Strong pseudoprimes to base 96.at n=11A020322
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=14A049949
- 24-gonal numbers: a(n) = n*(11*n-10).at n=37A051876
- a(0) = 1; a(n) = Sum_{0 <= k < n and gcd(k, n) != 1} a(k).at n=28A054251
- Numbers k such that the smoothly undulating palindromic number (14*10^k - 41)/99 is a prime.at n=6A062210
- Let a,b be prime numbers satisfying the Diophantine equation a^3+b^3=(a+b)*(a^2-a*b+b^2)=c^2. Then the second factor a^2-a*b+b^2 is 3*e^2 for some integer e. This sequence tabulates the 'e' values, sorted by magnitude of c.at n=2A099809
- Inverse permutation to sequence A083872.at n=18A119628
- a(1) = 1; for n>1, a(n) = the smallest number p > a(n-1) such that (a(n-1)+p)/2 is a cube.at n=23A126950
- Concatenation of first n nonprime numbers.at n=4A132934
- Number of nonnegative integer arrays of length n+3 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value 2.at n=8A211842
- T(n,k)=Number of nonnegative integer arrays of length n+2k+1 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value k+1.at n=44A211849
- Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.)at n=21A274410
- Numbers n such that gcd(phi(n), n-1) > lambda(n).at n=34A283656