14239
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14760
- Proper Divisor Sum (Aliquot Sum)
- 521
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13720
- Möbius Function
- 1
- Radical
- 14239
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Numbers whose set of base-15 digits is {3,4}.at n=25A032839
- T(n,n), array T as in A047060.at n=9A047062
- Sum of antidiagonals of A060736.at n=29A061349
- Composite numbers whose divisors (except 1) all contain the digit 9.at n=23A062680
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 3)/3.at n=14A063494
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=32A066696
- Numbers k such that k divides Sum_{j=1..k} prime(j)^19.at n=10A131279
- Number of binary strings of length n with no substrings equal to 0001 0011 or 1000.at n=13A164456
- a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.at n=46A182306
- Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=9A206337
- Number of (w,x,y) with all terms in {0,...,n} and w>=range{w,x,y}.at n=28A212968
- a(n) = 8*n^2 + 3*n + 1.at n=42A236267
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+2k)^k for 0 <= k <= n .at n=63A248829
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by more than one.at n=5A269579
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by more than one.at n=41A269583
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by more than one.at n=3A269586
- 37-gonal numbers: a(n) = n*(35*n-33)/2.at n=29A282852
- Expansion of 1/(2 + x - theta_2(sqrt(x))/(2*x^(1/8))), where theta_2() is the Jacobi theta function.at n=54A303908
- Numbers that are the sum of four positive cubes in exactly five ways.at n=32A343986
- Numbers that are the sum of four positive cubes in five or more ways.at n=37A343987