14407
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14408
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14406
- Möbius Function
- -1
- Radical
- 14407
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1688
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Sum of 12 nonzero 8th powers.at n=30A003390
- Fibonacci sequence beginning 1, 23.at n=15A022393
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=17A031844
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5).at n=35A039844
- a(n) = Sum_{k=0..n-1} binomial(n-1,k)*binomial(n+k,k). Also a(n) = T(n,n), array T as in A049600.at n=7A047781
- Convolution of A055853 with A011782.at n=7A055854
- Numbers k such that k^6 == 1 (mod 7^4).at n=36A056092
- Primes with 19 as smallest positive primitive root.at n=12A061331
- Primes p such that p-1 divides 2^p-2.at n=17A069051
- Final terms of rows of A077321.at n=41A077323
- Primes of the form k^2 + 7.at n=32A079138
- Primes of the form p^k - p^(k-1) + 1 for some prime p and integer k > 1.at n=15A087126
- Primes of the form 6*k^2 + 1.at n=14A090687
- a(n) = n*(4*n^6 + 70*n^4 + 196*n^2 + 45)/315.at n=7A099193
- Initial members of quintuplets (p, p+4, p+12, p+16, p+24) of consecutive primes with the corresponding difference pattern is {4,8,4,8}.at n=1A102331
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=45A103231
- Primes from merging of 5 successive digits in decimal expansion of (Pi^2).at n=8A104928
- Triangle read by rows: T(n,k) is the number of bicolored Dyck paths of semilength n and having k peaks of the form ud (0 <= k <= n). A bicolored Dyck path is a Dyck path in which each up-step is of two kinds: u and U.at n=29A114608
- Number of base 7 n-digit numbers with adjacent digits differing by five or less.at n=5A126528
- Primes p such that p, p+4 and p+12 are consecutive primes.at n=37A139385