10622
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 5794
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5152
- Möbius Function
- -1
- Radical
- 10622
- 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
- 99
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions into non-integral powers.at n=11A000298
- If a, b in sequence, so is ab+10.at n=42A009368
- Numbers whose set of base-15 digits is {2,3}.at n=24A032815
- Euler transform applied three times to partition triangle A008284.at n=51A055886
- One-sixtieth of the even leg of Pythagorean triangles whose other sides are both primes (other than 3, 5 or 13).at n=35A068485
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids.at n=68A094322
- Expansion of g.f. 2*x / ((1+x)^2*(1-2*x)^2).at n=10A095977
- a(n) = (n^3 - 7*n + 12)/6.at n=39A105163
- Number of right triangles on an (n+1) X 5 grid.at n=18A189809
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=14A217164
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 175) or the same sequence for the mesh patterns (12, 235), (12, 430), (12, 490).at n=10A289593
- Number of n X 2 0..1 arrays with every element equal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=7A297917
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=37A297923
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=43A297923
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=37A298337
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=43A298337
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=37A298547
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=43A298547
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=37A299228
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=43A299228