12247
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12616
- Proper Divisor Sum (Aliquot Sum)
- 369
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11880
- Möbius Function
- 1
- Radical
- 12247
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 187
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(9*n-2).at n=37A013656
- ATS: Add Then Sort (i.e., double previous term and then sort digits).at n=22A057615
- Positive numbers whose product of digits is 7 times their sum.at n=30A062384
- Sum of the first n Sophie Germain primes.at n=35A066819
- Number of partitions of n into Lucas parts (A000032).at n=59A067593
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.at n=36A072205
- Numbers n which are divisors of the number produced by concatenating (n-10), (n-9), (n-8), ... (n-1) in that order.at n=2A088872
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4)], where SORT places digits in ascending order and deletes 0's.at n=39A108565
- Triangle, read by rows, where column 0 is [1,-1,-2,-3,...,-n,...] and column k+1 is generated by the binomial transform of column k preceded by a zero (column k includes the k zeros above the main diagonal).at n=59A117334
- Pyramid game person numbers that have integer solutions.at n=19A135051
- Eigensequence of triangle A168316.at n=12A168317
- a(n) = 8*n^2 + 2*n + 1.at n=39A188135
- Integer nearest f(2^n), where f(x) = Sum of ( mu(k) * H(k)/k^(3/2) * Integral Log(x^(1/k)) ) for k = 1 to infinity, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=16A201542
- Number of distinct values taken by 9th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=12A216062
- Number of distinct permanental polynomials among all simple undirected graphs on n nodes.at n=8A249696
- Numbers whose sum of even digits and sum of odd digits are equal and whose digits are in nondecreasing order.at n=32A340125
- Indices where the cumulative sum of cos(2k+1)^(2k+1) reaches a record low value.at n=31A389560