12263
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12264
- 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
- 12262
- Möbius Function
- -1
- Radical
- 12263
- 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
- 143
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1466
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form 4*k^2 + 163.at n=47A057604
- Safe primes which are also Sophie Germain primes.at n=33A059455
- Numbers k such that (5^k - 2^k)/3 is prime.at n=13A082182
- Primes of the form 8*k-1 such that 4*k-1 and 16*k-1 are also primes.at n=17A101792
- Lesser prime in pair prime(k) +/- k for some k.at n=23A107636
- Primes which are the sum of a twin prime pair - 1.at n=44A118072
- a(1)=2, a(2)=3; a(n)=a(n-2)+s^2, where s^2 is a minimal square such that a(n) is prime and is not already in the sequence.at n=39A127494
- An example of a simple prime-generating algorithm similar to Rowland's (A106108) that is a particular instance of a more general algorithm (see comments).at n=35A141537
- Primes of the form 2*3*5*7*n+83.at n=29A141570
- Primes congruent to 16 mod 37.at n=38A142125
- Primes congruent to 4 mod 41.at n=37A142201
- Primes congruent to 8 mod 43.at n=37A142257
- Primes congruent to 43 mod 47.at n=35A142394
- Primes congruent to 13 mod 49.at n=37A142425
- Primes congruent to 20 mod 53.at n=26A142550
- Primes congruent to 53 mod 55.at n=38A142639
- Primes congruent to 50 mod 59.at n=24A142777
- Primes congruent to 2 mod 61.at n=24A142800
- Primes congruent to 41 mod 63.at n=39A142912
- Beginnings of maximal chains of primes with three members (two links).at n=41A152866