14496
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
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 38304
- Proper Divisor Sum (Aliquot Sum)
- 23808
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 906
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 19
- 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
- yes
- Odd
- no
Appears in sequences
- Ooguri-Vafa invariants of disk domain wall degeneracies for brane I in the O(K) -> P^1 X P^1 geometry.at n=2A061618
- a(n) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.at n=28A075681
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.at n=14A081157
- Number of even cycles in range [A014137(2n-1)..A014138(2n-1)] of permutation A057505/A057506, with no fixed points of A057164.at n=7A081158
- Sum_{k=2..n} min(k,n-k)*phi(k)*(n-k).at n=26A092274
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=38A092446
- Numbers k such that k + sigma(k) + phi(k) is a square.at n=22A116009
- Antidiagonal sums of table A162430.at n=10A162434
- Number of nondecreasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero.at n=36A188212
- a(n) = a(n-1) + a(n-2) + n + 1, a(0) = a(1) = 1.at n=17A210677
- Number of steps to go from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.at n=17A213709
- Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=16A221597
- sigma(n) is an additive inverse of n modulo phi(n).at n=15A235989
- Number of (1+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=9A250878
- a(n) = gpf(a(n-3))*gpf(a(n-2)) + gpf(a(n-1)), with a(1)=a(2)=1 and a(3)=2 and where gpf(n) is the greatest prime dividing n, A006530(n).at n=42A258804
- Numbers n = concat(s,t) such that sigma(n) - n = sigma(s) * sigma(t), where sigma(n) - n is the sum of the aliquot parts of n.at n=10A271632
- Expansion of Product_{k>=1} (1 - p(k)*x^k), where p(k) = number of partitions of k (A000041).at n=30A304785
- Expansion of Sum_{k>=1} k^2 * x^k/(1 - x^k)^3.at n=47A309732
- Numbers with more than one Collatz tripling step whose odd Collatz trajectory does not contain primes.at n=19A319936
- a(n) = a(n-1) - a(n-2) + a(n-3) + a(n-4), with a(1) = a(2) = a(3) = a(4) = 1.at n=39A343885