12241
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12242
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12240
- Möbius Function
- -1
- Radical
- 12241
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1463
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Sextan primes: p = (x^6 + y^6)/(x^2 + y^2).at n=22A002647
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=41A007773
- Number of partitions of n into at most 7 parts.at n=46A008636
- Number of partitions of n into 7 unordered relatively prime parts.at n=46A023027
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=27A024850
- Number of partitions of n in which the greatest part is 7.at n=53A026813
- Numbers k such that 53*2^k+1 is prime.at n=16A032376
- Euclid-Mullin sequence (A000945) with initial value a(1)=65537 instead of a(1)=2.at n=27A051332
- Primes followed by a [10,2,10] prime difference pattern of A001223.at n=17A052376
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=25A059287
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=24A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=26A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=18A059668
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.at n=19A059669
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=30A070184
- Smallest prime of the form concatenation n, 2n, 3n,...kn and 1.at n=11A090921
- Primes connected to two primes by the (p+1)/2 and 2p-1 operators.at n=30A109835
- Primes such that the sum of the predecessor and successor primes is divisible by 31.at n=36A113155
- Numbers k such that k + sigma(k) + sigma(sigma(k)) is a square.at n=33A116014
- Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an odd level (n >= 1, k >= 0).at n=53A121529