14401
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14402
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14400
- Möbius Function
- -1
- Radical
- 14401
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1687
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 1 (mod 4) where class number of Q(sqrt p) increases.at n=8A002142
- Primes of the form k^2 + 1.at n=21A002496
- Compositions: 6th column of A048004.at n=12A006980
- Expansion of e.g.f. sin(x)/cosh(log(1+x)).at n=9A009557
- a(n) = (n!)^2 + 1.at n=5A020549
- Sum of the lengths of the cycle types of the permutation created by duality and reversal on the partitions of n.at n=34A036050
- Primes of the form (k!)^2 + 1.at n=4A051739
- Number of positive integers <= 2^n of form 9 x^2 + 9 y^2.at n=19A054193
- Totient(n) and cototient(n) are squares.at n=40A054754
- Odd powers of primes of the form q = x^2 + 1 (A002496).at n=30A054755
- Numbers whose divisors have the form m^k + 1, k>1.at n=23A054964
- Primes p such that the greatest prime divisor of p-1 is 5.at n=35A061599
- Primes of form 100*k + 1.at n=41A062800
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.at n=22A065557
- a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.at n=40A066529
- Primes which can be expressed as concatenation of powers of 4 and 0's.at n=14A066595
- Primes p such that the period of the decimal expansion of 1/p is a square.at n=22A072858
- Primes p = product(A073692(n), A073692(n)+2,..., A073692(n+1)-2) plus 2.at n=25A073691
- Primes p such that (p-1) and the period length of 1/p are both squares.at n=11A076516
- Primes of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).at n=35A078324