14025
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26784
- Proper Divisor Sum (Aliquot Sum)
- 12759
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6400
- Möbius Function
- 0
- Radical
- 2805
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of n-step mappings with 4 inputs.at n=17A005945
- Numbers k such that sigma(k) = sigma(k+5).at n=7A015865
- Consider pairs (k,m) such that k^2 begins with a 1 and when the 1 is changed to a 2 we again get a square, m^2; sequence gives values of k for primitive solutions.at n=2A018233
- Number of 10's in all partitions of n.at n=43A024794
- Numbers k such that 231*2^k+1 is prime.at n=45A032492
- a(n) = (2*n+1)*(3*n+1)*(4*n+1).at n=8A033591
- A triangle of numbers related to triangle A030526.at n=17A049353
- Numbers k such that floor(exp(k)) is prime.at n=11A050808
- a(n) = ((8*n+9)(!^8))/9, related to A045755 ((8*n+1)(!^8) octo- or 8-factorials).at n=3A053114
- Triangle T(n,k) of number of minimal 2-covers of a labeled n-set that cover k points of that set uniquely (k=2,..,n).at n=52A057963
- Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=19A105276
- Number of permutations of n distinct letters (ABCD...) each of which appears 5 times and having n-2 fixed points.at n=33A123296
- Numbers n for which nontrivial positive magic squares of exactly 10 different orders with magic sum n exist. For a definition of nontrivial positive magic squares, see A125005.at n=36A125017
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+647)^2 = y^2.at n=7A130013
- Triangle read by rows: (1/3) * (A007318^2 - A007318^(-1)) as infinite lower triangular matrices.at n=58A131048
- Partition number array, called M32(-5), related to A013988(n,m)= |S2(-5;n,m)| ( generalized Stirling triangle).at n=22A144268
- Transform of the finite sequence (1, 0, -1, 0, 1, 0, -1) by the T_{0,1} transform (see link).at n=11A159342
- Positions of 3's in A234323.at n=24A234804
- a(n) = n*(n + 1)*(17*n - 14)/6.at n=17A237617
- Least number k such that n*k^n +/- 1 are twin primes, or a(n) = 0 if no such number exists.at n=9A239735