14406
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 33612
- Proper Divisor Sum (Aliquot Sum)
- 19206
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4116
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 6
- 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
- 120
- 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
- Numbers that are the sum of 11 positive 8th powers.at n=28A003389
- a(n) = floor(n/5)*floor((n+1)/5)*floor((n+2)/5)*floor((n+3)/5)*floor((n+4)/5).at n=34A008382
- Second-order Fibonacci numbers.at n=18A010049
- Numbers k such that k divides 2^(k+1) - 2.at n=38A014741
- Positive integers n such that n | (2^n + n/2 - 1).at n=36A015942
- Numbers of form 6^i*7^j, with i, j >= 0.at n=19A025626
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 40.at n=5A031718
- Numbers k such that sigma(phi(k)) = phi(sigma(k)).at n=8A033632
- Weigh transform of A007561.at n=12A035079
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*7^j.at n=12A038273
- Numbers whose base-7 representation contains exactly four 0's.at n=5A043396
- First differences of 7^n (A000420).at n=5A055272
- Coefficient triangle for certain polynomials.at n=16A055864
- Second column of triangle A055864.at n=5A055865
- Deepest position in the deck reached by card 1 before returning to the top in the shuffle in A035485 and A035499.at n=7A057974
- Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).at n=28A064010
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,5.at n=26A064239
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=31A064244
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,51.at n=5A064262
- Numbers k such that phi(2*sigma(k)) = 2*sigma(phi(k)).at n=12A067709