14497
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
- 8
- Divisor Sum
- 17600
- Proper Divisor Sum (Aliquot Sum)
- 3103
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11664
- Möbius Function
- -1
- Radical
- 14497
- 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
- 133
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n-th prime number * n-th lucky number.at n=28A032601
- 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=16A075134
- Number of distinct lines through the origin in 3-dimensional cube of side length n.at n=25A090025
- a(n) = gcd(f(n), f(n+1)) where f(n) = n^4 + n^2 + 1.at n=45A111002
- a(n) = 3*a(n-1) - a(n-2) - a(n-3) + 12.at n=9A121991
- Products of three distinct happy primes A035497.at n=19A154717
- Products of three distinct primes of the form 6*k + 1.at n=31A154729
- Odd squarefree numbers n > 1 such that lambda(n)^2 = phi(n), where lambda is the Carmichael lambda function and phi is Euler's totient function.at n=15A276980
- Maximally idempotent integers with three or more factors.at n=25A306812
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=37A320719
- a(n) = Sum_{d|n} phi(d)^(n/d+1).at n=32A342488
- Primitive terms of A359563: terms of A359563 with no proper divisor in A359563.at n=31A359564