14405
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17952
- Proper Divisor Sum (Aliquot Sum)
- 3547
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11088
- Möbius Function
- -1
- Radical
- 14405
- 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
- 120
- 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
- no
- Odd
- yes
Appears in sequences
- Number of bipartite partitions.at n=16A002763
- Sum of 10 nonzero 8th powers.at n=26A003388
- Number of 3's in all partitions of n.at n=33A024787
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 48.at n=4A031726
- Denominators of continued fraction convergents to sqrt(295).at n=9A041555
- Numbers whose base-7 representation contains exactly four 6's.at n=5A043420
- Numbers k such that k^6 == 1 (mod 7^4).at n=35A056092
- Number of partitions of n into parts but with two kinds of parts of sizes 1,2,3,4,5 and 6.at n=19A103925
- a(n) = 25*n^2 + 5.at n=23A158445
- Numbers of the form i*7^j-1 (i=1..6, j >= 0).at n=29A181303
- Number of (n+3) X 9 binary arrays with every 4 X 4 subblock commuting with each horizontal and vertical neighbor 4 X 4 subblock.at n=9A188102
- Augmentation of the triangular array |A123191|. See Comments.at n=34A193559
- a(n) = 6*7^n-1.at n=4A198688
- Composite squarefree numbers n such that p(i)+5 divides n-5, where p(i) are the prime factors of n.at n=7A225715
- Numbers k such that C(k+2,2) divides 2^(k+1) - 1.at n=17A246636
- a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(4,1).at n=49A268527
- Number of ways to transform a sequence of n ones to a single number by continually removing two numbers and replacing them with their sum modulo 3.at n=13A276027
- Numbers k such that k!6 + 36 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=26A288449
- a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).at n=14A304508
- Least integer N > 2 such that the number of primes (<=N) <= the number of base-n-zero containing numbers (<=N).at n=22A306521