12823
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12824
- 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
- 12822
- Möbius Function
- -1
- Radical
- 12823
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- 1529
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 8x + 9.at n=8A023295
- Primes that remain prime through 3 iterations of function f(x) = 10x + 9.at n=34A023301
- Primes that remain prime through 4 iterations of function f(x) = 10x + 9.at n=8A023329
- Primes that remain prime through 5 iterations of the function f(x) = 10x + 9.at n=3A023357
- a(n) is the first prime p from A031924 such that A052180(primepi(p)) = prime(n).at n=23A052229
- Numerators of continued fraction convergents to cosh(1).at n=8A078983
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,3}.at n=27A079965
- Primes p that divide Fibonacci[(p+1)/7].at n=21A125252
- Primes in A023108(n); or Lychrel primes.at n=32A135316
- Primes of the form 210n + 13.at n=30A140841
- Primes congruent to 21 mod 37.at n=38A142130
- Primes congruent to 31 mod 41.at n=42A142228
- Primes congruent to 9 mod 43.at n=31A142258
- Primes congruent to 39 mod 47.at n=31A142390
- Primes congruent to 34 mod 49.at n=38A142443
- Primes congruent to 50 mod 53.at n=29A142580
- Primes congruent to 55 mod 57.at n=39A142699
- Primes congruent to 20 mod 59.at n=25A142747
- Primes congruent to 13 mod 61.at n=27A142811
- Primes congruent to 34 mod 63.at n=42A142908