11610
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 31680
- Proper Divisor Sum (Aliquot Sum)
- 20070
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 1290
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- Tricapped prism numbers.at n=19A005920
- Nearest integer to Gamma(n + 3/5)/Gamma(3/5).at n=8A020038
- a(n) = floor( Gamma(n + 3/5)/Gamma(3/5) ).at n=8A020083
- Numbers whose set of base-14 digits is {3,4}.at n=23A032838
- Numerators of continued fraction convergents to sqrt(322).at n=5A041608
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the smallest number such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=13A049961
- Numbers n such that 105*2^n-1 is prime.at n=32A050578
- a(n) = 6*n^2 + 12*n.at n=42A067726
- Number of log-concave compositions (ordered partitions) of n.at n=43A069916
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=19A070735
- 63-gonal numbers: a(n) = n*(61*n - 59)/2.at n=20A098140
- Triangle T(n,k) read by rows: number of lattice paths from (0,0) to (0,2n) with steps (1,1) or (1,-1) that stay between the lines y=0 and y=k.at n=39A101475
- Triangular array where T(n,k) is the number of set partitions of n with k atomic parts.at n=47A127743
- Another version of triangle in A127743.at n=58A130167
- a(n) = sum of n successive primes after the n-th prime.at n=39A131740
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=10A148152
- a(n) = 16*n^2 - 2*n.at n=26A158058
- Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=6A162743
- Numbers k such that 9*k! + 1 is prime.at n=26A180626
- Number of distinct solutions of Sum_{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2.at n=41A180814