13308
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 31080
- Proper Divisor Sum (Aliquot Sum)
- 17772
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4432
- Möbius Function
- 0
- Radical
- 6654
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Maximal matchings in rooted plane trees on n nodes.at n=8A007860
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=36A025004
- All 81 combinations of prefixing and following a(n) by a single digit are nonprime.at n=4A032734
- Composite numbers k such that all the decimal concatenations ik and ikj (i, j = 1...9) are also composite.at n=2A032737
- Number of separate orbits to which permutations given in A057511/A057512 (induced by deep rotation of general parenthesizations/plane trees) partition each A000108(n) objects encoded by A014486 between (A014138(n-1)+1)-th and (A014138(n))-th terms.at n=11A057513
- McKay-Thompson series of class 30B for the Monster group with a(0) = 0.at n=35A058613
- Start with x, y; then concatenate each word in turn with all preceding words, getting x y xy xxy yxy xxxy yxxy xyxxy ...; sequence gives number of words of length n. Also binary trees by degree: x y (x,y) (x,(x,y)) (y,(x,y)) (x,(x,(x,y))) (y,(x,(x,y))) ((x,y),(x,(x,y)))...at n=11A063894
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=17A088066
- Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] variables is between k and k+1.at n=45A101842
- Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] variables is between k and k+1.at n=52A101842
- Triangle formed by left half of A101842, read by rows.at n=24A101845
- Triangle formed by right half of A101842, read by rows.at n=24A102012
- Numbers with no 1's in base 3 & 4 expansions.at n=38A117496
- Number of base 8 circular n-digit numbers with adjacent digits differing by 4 or less.at n=5A125345
- Numbers whose base-b expansions, for both b=3 and b=4, include no digits other than 0 and b-1.at n=3A261970
- Number of ways to choose three distinct points from a 4 X n grid so that they form an isosceles triangle.at n=45A271913
- Number of partitions of n with up to three distinct kinds of 1.at n=34A320690
- Number of integer partitions of n with as many even parts as even conjugate parts.at n=47A350948
- Number of different multisets that can be obtained by choosing a prime index (or a prime factor) of each integer from 2 to n.at n=41A355746
- Number of different multisets that can be obtained by choosing a prime index (or a prime factor) of each integer from 2 to n.at n=42A355746