14965
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
- 18648
- Proper Divisor Sum (Aliquot Sum)
- 3683
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11520
- Möbius Function
- -1
- Radical
- 14965
- 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
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=24A062693
- Least k such that k*10^n+1, k*10^n+3, k*10^n+7 and k*10^n+9 are all prime.at n=9A064281
- Numbers k such that 1000000000k+1, 1000000000k+3, 1000000000k+7, 1000000000k+9 are all primes.at n=0A064968
- a(n) = (prime(n)^2 + 1)/2.at n=38A066885
- Third row of Pascal-(1,5,1) array A081580.at n=29A081589
- a(n) = sigma_4(n^2)/sigma_2(n^2).at n=11A084218
- a(n) = 8*n^2 + 4*n + 1.at n=43A102083
- Least k such that prime(n)^2 divides binomial(2k,k).at n=39A110494
- a(n) = 5*a(n-1)+16*a(n-2), n>1 ; a(0)=0, a(1)=1.at n=6A155455
- a(n) is the smallest number m from A173977 for which A020639(2m-1) = prime(n).at n=38A173979
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 1,3,4,6,0,2,6 for x=0,1,2,3,4,5,6.at n=6A197650
- Number of 3 X n 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=12A223839
- Numbers k such that sigma(2*k-1) is a prime p.at n=14A247820
- a(n) = n^4 + 324.at n=11A272298
- Products p*q*r of three distinct primes such that (p*q) mod r, (p*r) mod q and (q*r) mod p are all prime.at n=16A338704
- Centered square numbers which are sphenic numbers.at n=5A380882