12161
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12162
- 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
- 12160
- Möbius Function
- -1
- Radical
- 12161
- 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
- 1456
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/8 ).at n=47A011890
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=34A024599
- Schoenheim bound L_1(n,5,4).at n=31A036832
- Primes resulting from procedure described in A048393.at n=18A048394
- Lesser of twin primes whose average is 6 times a prime.at n=29A060213
- Primes which can be expressed as concatenation of cubes.at n=30A066592
- Primes which can be expressed as concatenation of powers of 6 and 0's.at n=17A066597
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.at n=40A080076
- Smallest prime with "n^3" as central digit(s).at n=6A084430
- Primes such that a sum of any two adjacent digits is prime; first and last digits are considered adjacent.at n=36A086244
- Primes produced by repeated application of the formula p -> (4p +- 3) starting at the prime 2.at n=20A086319
- Lower twin primes with lower twin prime index.at n=16A088460
- Remove the least number of commas from A093086 and concatenate digits so as to always have a(n) < a(n+1).at n=9A102085
- Primes of the form 256n+129.at n=13A105130
- Coefficients of the A-Rogers mod 14 identity.at n=38A105780
- Primes with digital product = 12.at n=12A107697
- Primes of the form prime(n+1)*prime(n+3) - prime(n)*prime(n+2) - 1, ordered by n.at n=36A118624
- Numbers k such that Fibonacci(prime(k)) is prime.at n=33A119984
- a(n) = 104*n + 9977.at n=21A126978
- Mother primes of order 9.at n=34A136068