10268
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 8884
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 5134
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- Powers of sqrt(14) rounded up.at n=7A017948
- Powers of fourth root of 14 rounded up.at n=14A018086
- Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).at n=34A019298
- Fibonacci sequence beginning 2, 26.at n=14A022375
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=28A025017
- Numbers with exactly five distinct base-10 digits.at n=22A031987
- Low-temperature partition function expansion for Kagome net (Potts model, q=3).at n=15A057401
- Records in A118514.at n=15A118515
- Number of distinct angles in all integer-sided triangles with all sides <= n.at n=39A123325
- Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2.at n=39A126218
- Position of cubes in the EKG sequence (A064413).at n=21A140418
- Partial sums of A165271.at n=26A165273
- Number of nonempty subsets of {1, 2, ..., n} with <=7 pairwise coprime elements.at n=24A187268
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two or four distinct values for every i,j,k<=n.at n=10A211567
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=57A222541
- Number of 3Xn 0..1 arrays with no more than floor(3Xn/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=8A222543
- Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).at n=70A237568
- Number of (n+2) X (4+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101.at n=5A261109
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101.at n=3A261111
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101.at n=39A261113