10269
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17056
- Proper Divisor Sum (Aliquot Sum)
- 6787
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5832
- Möbius Function
- 0
- Radical
- 3423
- 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
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 2's in all partitions of n.at n=29A024786
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=44A026055
- Numbers with exactly five distinct base-10 digits.at n=23A031987
- Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.at n=3A068805
- Number of n X 4 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=2A069295
- Number of 4 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=2A069308
- Sum of terms in n-th group in A075352.at n=44A075356
- Numbers n such that s=n^2 gives prime quadruples (30s+11, 30s+13, 30s+17, 30s+19).at n=2A087772
- Number of occurrences of smallest prime factor in all partitions of n-th composite number: a(n)=A066633(A002808(n), A056608(n)).at n=18A091109
- If a(n) is a k-digit number, a(n+1) is the product of the number formed by the initial k-1 digits of a(n) and the final digit of a(n). If k=1, set a(n+1) = 0.at n=1A115753
- Numbers of the form 68+p^2 (where p is a prime).at n=25A138691
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (1, -1), (1, 1)}.at n=8A151274
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=20A162258
- Numbers k such that k^3 divides 17^(k^2) + 1.at n=16A177817
- Numbers k for which 5*k-4, 5*k-2, 5*k+2, and 5*k+4 are primes.at n=24A178082
- Number of flat special rim-hook tableaux.at n=19A178940
- Numbers n such that n!8 + 2 is prime.at n=48A204663
- Number of -3..3 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 one, three, four, five, six or seven distinct values for every i,j,k<=n.at n=4A211745
- Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=20A219774
- Number T(n,k) of equivalence classes of ways of placing k 9 X 9 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=9, 0<=k<=floor(n/9)^2, read by rows.at n=46A236936