13267
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13268
- 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
- 13266
- Möbius Function
- -1
- Radical
- 13267
- 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
- 76
- 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
- 1577
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Cuban primes: primes which are the difference of two consecutive cubes.at n=31A002407
- Discriminants of imaginary quadratic fields with class number 11 (negated).at n=37A046008
- T(n,n+1), array T as in A047100.at n=8A047106
- Primes arising in A048969.at n=26A048977
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=14A049937
- Primes p such that x^67 = 2 has no solution mod p.at n=24A059330
- Images of centered hexamorphic numbers: suppose k-th centered hexagonal number H_c(k) (A003215) ends in k; sequence gives value of H_c(k).at n=4A060201
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 16.at n=32A095651
- Smallest prime ending in prime(n) and == 1 (mod prime(n)), or 0 if no such prime exists.at n=18A096069
- Primes p such that q-p = 24, where q is the next prime after p.at n=21A098974
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=31A109561
- Median of the largest prime dividing the first 10^n numbers greater than 1.at n=6A126282
- Largest number k such that k^2 divides A007781(6n+1).at n=32A127854
- Hex (or centered hexagonal) numbers that are prime powers of the form (6n+1)^k.at n=32A133323
- Primes of the form 210k + 37.at n=29A140847
- Primes congruent to 21 mod 37.at n=39A142130
- Primes congruent to 24 mod 41.at n=37A142221
- Primes congruent to 23 mod 43.at n=39A142272
- Primes congruent to 13 mod 47.at n=32A142364
- Primes congruent to 37 mod 49.at n=36A142445