14298
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28608
- Proper Divisor Sum (Aliquot Sum)
- 14310
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4764
- Möbius Function
- -1
- Radical
- 14298
- 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
- 50
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n with at least 1 odd and 1 even part.at n=35A006477
- a(n) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=32A014203
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between pairs.at n=40A015636
- Number of solutions to c(1)*prime(2)+...+c(n)*prime(n+1) = 1, where c(i) = +-1 for i > 1, c(1) = 1.at n=22A022898
- Number of partitions of n into parts 4k and 4k+2 with at least one part of each type.at n=70A035622
- Number of partitions of n with some part repeated.at n=35A047967
- Starting positions of strings of three 8's in the decimal expansion of Pi.at n=9A083637
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=32A117720
- a(n) = 841*n + 1.at n=16A158404
- Number of subsets of {1, 2, ..., n} containing n and having <=5 pairwise coprime elements.at n=40A186989
- Main diagonal of square arrays A114881 and A249741.at n=21A249743
- Number of ways of n-coloring the square grid graph G_(3,3) such that no rectangle exists with sides parallel to the axes having all 4 corners of the same color.at n=3A252778
- Expansion of Product_{k>=1} 1/(1 - x^k)^(sigma_2(k)).at n=10A275585
- Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = sqrt(3).at n=44A279588
- a(n) = (Sum_{i=1..n-1} i^(n-2)) mod n^3.at n=35A284759
- Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1.at n=17A336288
- Number of distinct ways of expressing n using only addition, multiplication (with all factors greater than 1), necessary parentheses, and the number 1.at n=40A373446
- Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and treedepth k.at n=39A387046