12176
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 23622
- Proper Divisor Sum (Aliquot Sum)
- 11446
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6080
- Möbius Function
- 0
- Radical
- 1522
- Omega Function (Ω)
- 5
- 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
- 37
- 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
- a(n) = n OR n^3 (applied to ternary expansions).at n=22A008469
- Composite numbers k such that digits in k and in juxtaposition of prime factors of k are the same (apart from multiplicity).at n=25A035141
- Numerators of continued fraction convergents to sqrt(620).at n=4A042190
- a(n)=(2n)!*(sum{k=1...2n}1/k)/(2n+1).at n=4A114450
- Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=9A124658
- Square array read by antidiagonals: T(m,n) = H(n,2*m)*(2*m)!/(2*m+2*n-1). H(0,m) = 1/m, for all positive integers m. H(n,m) = Sum_{k=1..m} H(n-1,k).at n=13A136205
- G.f.: exp( Sum_{n>=1} x^n/n * exp( Sum_{k>=1} Lucas(n*k)*x^(n*k)/k ) ) where Lucas(n) = A000032(n).at n=15A203318
- a(n) = 2^n mod n^3.at n=33A233442
- Number of (n+1) X (n+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235190
- Number of (n+1) X (3+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235193
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=12A235198
- Number of partitions p of n that include (min(p) + max(p))/2 as a part.at n=43A238480
- a(n) = n XOR n^3.at n=23A261807
- a(n) = n*(25*n - 39)/2.at n=32A263231
- Numbers with at least three digits and with the property that the sum of the cubes of the first and last digit equals the number obtained when the first and last digits are deleted.at n=30A275343
- Sum of cubes of proper divisors of n.at n=45A276634
- Number of Dyck paths of semilength n such that each positive level up to the highest nonempty level has one or two peaks.at n=12A287963
- Triangle read by rows: Polynomial coefficients per comment.at n=34A290053
- Positive integers m such that m, m + 1 and m + 2 are a sum of a positive square and a positive cube.at n=28A295787
- Triangle read by rows: T(n,k) is the number of multiset partitions of weight n whose union is a k-set where each part has a different size.at n=53A332253