14308
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
- 18
- Divisor Sum
- 29526
- Proper Divisor Sum (Aliquot Sum)
- 15218
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 1022
- Omega Function (Ω)
- 5
- 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
- 76
- 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
- Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is allowed.at n=19A001371
- Aliquot sequence starting at 180.at n=25A008891
- Number of bracelets of length n using exactly two different colored beads.at n=18A056342
- Number of primitive (period n) bracelets using exactly two different colored beads.at n=18A056348
- Engel expansion of 1/gamma, (gamma is the Euler-Mascheroni constant A001620) = 1.73245.at n=11A059191
- Sum of binary numbers with n 1's and two (possibly leading) 0's.at n=7A059937
- a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/5).at n=49A120171
- Triangle read by rows: T(n,k) = (2^(n+1)-1)*binomial(n,k).at n=38A134346
- Triangle read by rows: T(n,k) = (2^(n+1)-1)*binomial(n,k).at n=42A134346
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A150129
- a(n) = 73*n^2.at n=14A174334
- Number of 6-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=20A186982
- Number of (n+2)X4 binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=4A187933
- Number of (n+2)X7 binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=1A187936
- T(n,k)=Number of (n+2)X(k+2) binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=16A187940
- T(n,k)=Number of (n+2)X(k+2) binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=19A187940
- Number of n X 4 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=8A223773
- Number of nX3 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=5A268804
- Number of nX6 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=2A268807
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=30A268809