12440
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 15640
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4960
- Möbius Function
- 0
- Radical
- 3110
- Omega Function (Ω)
- 5
- 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
- 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
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 3,0,2.at n=4A037657
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=30A064602
- Number of Young tableaux with n cells whose shape is symmetric.at n=12A067136
- a(n) is the smallest positive number B that yields a solution for k = A167219(n).at n=37A167221
- a(n) = A030068(4n+3).at n=42A169740
- The maximum integer dimension in which the volume of the hypersphere of radius n remains larger than 1.at n=26A177677
- a(n) = (3^n-n)*(n-1) - 2^n*(n-2).at n=6A189826
- Number of -3..3 arrays x(0..n-1) of n elements with nonzero sum and with zero through n-1 differences all nonzero.at n=5A200160
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with nonzero sum and with zero through n-1 differences all nonzero.at n=33A200165
- Number of -n..n arrays x(0..5) of 6 elements with nonzero sum and with zero through 5 differences all nonzero.at n=2A200169
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<=x^3+y^3.at n=27A211807
- a(n) = n*(n+1)*(22*n-19)/6.at n=15A256716
- Numbers k such that k and k+1 both have 16 divisors.at n=29A274359
- Triangle, read by rows, that transforms diagonals in the array A274390 of coefficients in successive iterations of Euler's tree function (A000169).at n=62A274570
- G.f.: 1/(1 - x/(1+2*x - x^3/(1+2*x^2 - x^5/(1+2*x^3 - x^7/(1+2*x^4 - x^9/(1 - ...)))))), a continued fraction.at n=65A275761
- Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HD and DU.at n=18A329698