10796
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18900
- Proper Divisor Sum (Aliquot Sum)
- 8104
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5396
- Möbius Function
- 0
- Radical
- 5398
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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 esters with n carbon atoms up to stereo-isomerism.at n=10A005958
- Sum of the first n twin prime pairs.at n=25A086169
- Numbers n such that first occurrence of the 10 digits of the i-th root of n contain all the digits from 0 to 9.at n=36A119521
- Number of distinct binomial(n,2)-tuples of zeros and ones that are obtained as the collection of all 2 X 2 minor determinants of a 2 X n matrix over GF(2).at n=6A123290
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,k), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0) (0<=k<=n).at n=56A132276
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=30A188148
- Number of nX3 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=3A209362
- Number of nX4 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=2A209363
- T(n,k) = Number of n X k 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=17A209365
- T(n,k) = Number of n X k 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=18A209365
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4.at n=25A209988
- Sum of largest parts of all partitions of n into an even number of parts.at n=26A222048
- Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=23A224134
- Number of partitions p of n containing floor((min(p) + max(p))/2) as a part.at n=38A238482
- a(n) = Sum_{k=1..n} prime(k)^2*floor(n/prime(k)) .at n=45A280385
- Numbers k such that 10^k - 800001 is prime.at n=16A288822