12160
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 30600
- Proper Divisor Sum (Aliquot Sum)
- 18440
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 190
- Omega Function (Ω)
- 9
- Little Omega Function (ω)
- 3
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
- 112
- 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 ways to represent n using the binary operator a * b = 2^a + b.at n=16A000630
- a(n) = n^3 - floor( n/3 ).at n=23A002901
- 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=19A006007
- Expansion of a cusp form of weight 8 for Gamma_1(6).at n=13A006354
- Expansion of e.g.f. cos(x)/cosh(sin(x)), even powers only.at n=4A009109
- Expansion of exp(x)/cos(sinh(x)).at n=8A009290
- Expansion of log(1+sin(sinh(x))).at n=9A009328
- Even octagonal numbers: a(n) = 4*n*(3*n-1).at n=32A014642
- Expansion of Product_{m>=1} (1+q^m)^(-15).at n=6A022610
- a(n) = (prime(n+2)^2 - 1)/3.at n=40A024700
- Numbers that are the sum of 4 nonzero squares in exactly 7 ways.at n=41A025363
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 13 (most significant digit on left).at n=22A029482
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 55.at n=22A031553
- McKay-Thompson series of class 18h for Monster.at n=56A058546
- Triangle read by rows: T(n,k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w + 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...at n=48A059474
- Triangle read by rows: T(n,k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w + 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...at n=51A059474
- a(1) = 4; a(n) = smallest composite number greater than the sum of all previous terms.at n=12A070232
- An interleaved sequence of pyramidal and polygonal numbers.at n=37A081283
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=37A088003
- E.g.f.: (1/(1-x^4))*exp( 4*Sum_{i>=0} x^(4*i+1)/(4*i+1) ) for an order-4 linear recurrence with varying coefficients.at n=6A097679