12569
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12570
- 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
- 12568
- Möbius Function
- -1
- Radical
- 12569
- 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
- 156
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1501
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 79.at n=10A020418
- Smallest prime containing n-th square as substring.at n=16A029948
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 44.at n=1A031632
- Smallest prime with "n^2" as central digit(s).at n=16A038370
- Smallest prime containing the n-th square in decimal notation.at n=15A065144
- Primes of the form 16*m^2 + 25 for m=1,2,3,...at n=13A087857
- A variation on Flavius's sieves (A000960, A099207): Start with the Chen primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=30A118500
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DDUU's starting at level 2.at n=34A135329
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions {floor(m*(m+7)/6), m>=0} and then taking partial sums, starting with all 1's in row 0.at n=21A136217
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions {floor(m*(m+7)/6), m>=0} and then taking partial sums, starting with all 1's in row 0.at n=30A136217
- Triangle P, read by rows, where column k of P^3 equals column 0 of P^(3k+3) such that column 0 of P^3 equals column 0 of P shift one row up, with P(0,0)=1.at n=21A136220
- Column 0 of triangles A136220 and A136228; also equals column 0 of tables A136217 and A136218.at n=6A136221
- Triangle U, read by rows, where column k of U^(j+1) = column j of P^(3k+1) for j>=0, k>=0 and P=A136220.at n=21A136228
- Triangle W, read by rows, where column k of W = column 0 of W^(k+1) for k>=0 such that W equals the matrix cube of P = A136220 with column 0 of W = column 0 of P shift up one row.at n=15A136231
- Least prime P such that 3*p(n)*P*(3*p(n)*P+1)-1, 3*p(n)*P*(3*p(n)*P+1)+1,3*p(n)*P*(3*p(n)*P+3)-1,3*p(n)*P*(3*p(n)*P+3)+1 are all primes with p(i) = i-th prime.at n=6A137839
- Primes congruent to 26 mod 37.at n=40A142135
- Primes congruent to 13 mod 43.at n=32A142262
- Primes congruent to 20 mod 47.at n=31A142371
- Primes congruent to 25 mod 49.at n=32A142435
- Primes congruent to 8 mod 53.at n=29A142538