12248
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22980
- Proper Divisor Sum (Aliquot Sum)
- 10732
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6120
- Möbius Function
- 0
- Radical
- 3062
- Omega Function (Ω)
- 4
- 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
- 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
- Expansion of e.g.f. exp(arcsinh(x)*tan(x)) (even powers only).at n=4A012610
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=47A024312
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=46A024875
- Analog of A059226 in which left diagonal is all 1's.at n=32A059274
- a(1) = a(2) = 1; a(n) = a(n-1) + concatenation of a(n-2) and a(n-1).at n=4A070312
- Numbers n such that the sum of the squares of the digits of n^n is a square.at n=17A171976
- Conjecturally, the largest k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).at n=24A239623
- 5-step Fibonacci sequence starting with 0,0,1,0,0.at n=19A251653
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 533", based on the 5-celled von Neumann neighborhood.at n=22A272784
- Ulam numbers k such that 4*k and 16*k are also Ulam numbers.at n=18A287634
- Numbers whose trajectories under the map x -> A230625(x) never reach a prime.at n=47A288847
- Number of leaf-balanced rooted plane trees with n nodes.at n=13A304175
- A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..2, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=40A319060
- a(n) = A323247(n) - A323243(n).at n=85A323248
- Möbius transform of A323244, the deficiency of A156552(n).at n=85A329644
- Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=20A340757
- Starts of runs of 4 consecutive numbers that have mutually distinct exponents in their prime factorization (A130091).at n=17A342030
- Irregular triangle: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 4213. 0 <= k <= A342646(n).at n=65A342840
- Number of reversed integer partitions of 2n whose half-alternating sum is 0.at n=24A357639
- Starts of runs of 3 consecutive integers that are all terms in A381581.at n=38A381583