12474
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 34848
- Proper Divisor Sum (Aliquot Sum)
- 22374
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3240
- Möbius Function
- 0
- Radical
- 462
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=29A014203
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 3).at n=42A035536
- Number of partitions of 3n with same number of parts == 1 (mod 3) and == 2 (mod 3).at n=14A035592
- Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=39A035957
- Triangular matrix arising in enumeration of catafusenes, read by rows.at n=59A038763
- Numbers n such that 65*2^n-1 is prime.at n=26A050558
- Least m such that n = m mod tau(m) if such m exists, otherwise 0.at n=33A066708
- From denominators in expansion of tan(arcsinh(x)) - sin(arctanh(x)).at n=6A068557
- Triangle of generalized Chebyshev coefficients.at n=50A080419
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 3x^2)^n.at n=58A084602
- Numbers k such that 2^k - 11 is prime.at n=14A096817
- Denominator of Cotesian number C(n,3).at n=7A100648
- Integers that are Rhonda numbers to more than one base.at n=22A100988
- Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=20A101416
- Triangle of coefficients in the numerators of rational functions in tanh(1) that express the (2n)th du Bois-Reymond constants as C_0 = 0, C_2 = -4 - 1/(1-tanh(1)), for n>1, C_2n = -3 - (Sum_{k=0..n} a(n,k)*tanh(1)^k) / (2^n*n! * (1-tanh(1))^n).at n=33A104053
- The first n primes, connected by, from left to right, alternating + and * signs.at n=19A106215
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=18A125016
- Triangle, read by rows, defined by: T(n,k) = Sum_{j=0..n-k-1} T(j+k,k)*T(n-j,k+1) for n > k >= 0, with T(n,n) = n+1.at n=41A127058
- Triangle read by rows: A007318^(-1) * A132812.at n=72A132816
- Eigentriangle, row sums = A125275.at n=33A147294