12462
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26112
- Proper Divisor Sum (Aliquot Sum)
- 13650
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3960
- Möbius Function
- 1
- Radical
- 12462
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Expansion of 1/((1-3x)(1-7x)(1-11x)(1-12x)).at n=3A028098
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=20A071863
- Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.at n=17A122158
- Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc.at n=36A123326
- a(n) = 225*n^2 - 251*n + 70.at n=8A156810
- Numbers n with property that 4 n^2 are squares arising in A158470.at n=30A158517
- The indexing sequence for successively better golden semiprimes.at n=17A165569
- Convolved with its aerated variant = A000041.at n=49A174065
- Third differences of A000219.at n=20A191661
- Union of A071863 and A071861.at n=45A193458
- Number of compositions of n such that the number of parts and the greatest part are not coprime.at n=15A199887
- Least k such that k*6^n-1 , k*6^n+1, and 2*k*6^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=21A212481
- a(n) = 2*n^3 - 4*n^2 + 10*n - 2 (n>=1).at n=18A304161
- Even numbers n such that A048633(n+1) = A048633(n).at n=46A331586
- Number of quaternary steady words of length n (with respect to the permutations of symbols).at n=42A357250
- Number of integer compositions of n that are the first sums of some composition with all parts > 1.at n=39A391235