12274
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
- 12
- Divisor Sum
- 20574
- Proper Divisor Sum (Aliquot Sum)
- 8300
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5472
- Möbius Function
- 0
- Radical
- 646
- Omega Function (Ω)
- 4
- 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
- 125
- 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
- Numbers n such that 261*2^n-1 is prime.at n=28A050889
- Positive numbers whose product of digits is 7 times their sum.at n=31A062384
- Smallest m such that C(2m,m) is divisible by (m+n)!/m!.at n=12A065352
- The floor[n^(3/4)]-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.at n=20A066363
- a(n) = 3*2^n - n - 2.at n=12A079583
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=14A114358
- Determinants of 2 X 2 matrices of non-overlapping blocks of 4 consecutive primes.at n=50A117027
- Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n having k peak plateaux (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)).at n=54A166285
- Numbers n such that the sum of prime factors of n (counted with repetition) equals three times the largest prime divisor.at n=35A212861
- Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^2.at n=48A261629
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood.at n=27A270219
- Number of species of connected partial Latin squares of size n.at n=7A286318
- Numbers k such that (76*10^k - 211)/9 is prime.at n=19A293189
- Number of length-n binary strings where every prefix is either a palindrome, or the concatenation of two palindromes.at n=46A297702
- a(n) = 34*n^2.at n=19A303302
- Number of vertex cuts in the n-Andrásfai graph.at n=5A362508
- Number of integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts.at n=34A364913
- Partial sums of A365414.at n=46A365444
- a(n) is the area of the rectangle whose edges are n and A375673(n).at n=35A375675