10496
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 21462
- Proper Divisor Sum (Aliquot Sum)
- 10966
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5120
- Möbius Function
- 0
- Radical
- 82
- Omega Function (Ω)
- 9
- Little Omega Function (ω)
- 2
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
- 117
- 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
- Numbers k in which the digits of k^2 appear.at n=16A029774
- Numerators of continued fraction convergents to sqrt(446).at n=7A041848
- n is divisible by the 4th power of the number of unitary divisors of n (A034444).at n=39A048170
- a(n) = T(n,3), array T as in A049600.at n=9A049612
- Triangle of partial row sums (prs) of triangle A055252.at n=36A055584
- Numbers k such that k^2 contains only digits {0,1,6}, not ending with zero.at n=3A058417
- 2^(n-1)*(n^2+2n+2).at n=8A084850
- Difference between A007678(2n)/(2n) and (n-1)^2.at n=33A085611
- Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares.at n=22A087150
- Triangle read by rows: numerators of Cotesian numbers C(n,k) (0 <= k <= n) if the denominators are set to the lcm's of the rows (A002176).at n=39A100642
- Triangle read by rows: numerators of Cotesian numbers C(n,k) (0 <= k <= n) if the denominators are set to the lcm's of the rows (A002176).at n=41A100642
- Expansion of g.f. (1 - x)^2*(1 + x) / (1 - 2*x)^2.at n=11A106472
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k hills (a hill is either a ud or a Udd starting at the x-axis).at n=31A108431
- Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).at n=27A135789
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=26A136862
- Number of permutations of floor(i*5/2), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147901
- Number of permutations of floor(i*5/2), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147909
- Number of permutations of floor(i*7/2), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147911
- Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147941
- Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147950