13567
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13568
- 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
- 13566
- Möbius Function
- -1
- Radical
- 13567
- 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
- 182
- 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
- 1605
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 64 ones.at n=29A031832
- Primes of the form 6*k^2 + 6*k + 31.at n=40A060844
- Primes of form Sum_{k=1..n} (prime(k)+1).at n=33A062736
- a(n+2) = a(n+1) + a(n) - (2*n + 1) where a(0)=7, a(1)=11.at n=17A088981
- Primes of the form k^2 - 7*k + 7.at n=28A089376
- Number of (inequivalent) fuzzy subgroups of the direct sum of group of integers modulo p^n and group of integers modulo 2 for a prime p with (p,2) = 1. Z_{p^n} + Z_2.at n=7A107392
- Primes in A112714.at n=44A112715
- Primes congruent to 37 mod 41.at n=38A142234
- Primes congruent to 22 mod 43.at n=34A142271
- Primes congruent to 31 mod 47.at n=36A142382
- Primes congruent to 43 mod 49.at n=38A142450
- Primes congruent to 52 mod 53.at n=31A142582
- Primes congruent to 37 mod 55.at n=40A142627
- Primes congruent to 1 mod 57.at n=40A142665
- Primes congruent to 56 mod 59.at n=29A142783
- Primes congruent to 25 mod 61.at n=29A142823
- Primes congruent to 22 mod 63.at n=39A142901
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=27A143035
- Number of primes p < 10^n such that s - p is prime, where s is the next square greater than p.at n=5A146757
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 0), (1, 0, 1)}.at n=7A150853