10996
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19250
- Proper Divisor Sum (Aliquot Sum)
- 8254
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5496
- Möbius Function
- 0
- Radical
- 5498
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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 such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=29A031820
- Dirichlet convolution of Fibonacci numbers with phi(n).at n=20A034748
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071667/A071668.at n=13A089876
- Triangle T, read by rows, such that diagonal n equals column 0 of T^(n+1), the (n+1)-th matrix power of T.at n=42A098447
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=39A110877
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 9.at n=29A136830
- a(n) = floor(sqrt(2*n^5)).at n=36A172473
- Number of symmetry classes of 3 X 3 magilatin squares with positive values < n.at n=17A173729
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=33A209982
- Numbers k such that sum of digits of k = sum of digits of anti-divisors of k.at n=11A213239
- Minimum even value unattainable as the sum of 6 attained values of i*(i-1) with i in 0..n.at n=45A225292
- Volume of the Johnson square pyramid (rounded down) with all the edge lengths equal to n.at n=35A229063
- Floor(compositorial(n) / n!), that is, floor(A036691(n) / A000142(n)).at n=11A233447
- Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x.at n=19A269310
- Number of n X 2 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=7A284765
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=37A284771
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=43A284771
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=43A285750
- Discriminants of imaginary quadratic fields with class number 42 (negated).at n=39A351680
- Lexicographically earliest sequence of distinct nonnegative terms wherein every digit of a(n) is the absolute difference of two adjacent digits in a(n+1).at n=30A362335