13303
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 305
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13000
- Möbius Function
- 1
- Radical
- 13303
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 35 ones.at n=3A031803
- Odd composite numbers which in base 2 contain their largest proper factor as a substring of digits.at n=24A063131
- Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring.at n=20A063138
- Total number of right truncatable primes in base n.at n=29A076586
- a(n) = Sum_{k=0..floor(n/5)} C(n-3*k,2*k) * 2^k.at n=21A098577
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=36A100438
- Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime.at n=25A111064
- Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=35A117395
- a(n) = 10 + floor( (1 + Sum_{j=1..n-1} a(j) )/3 ).at n=25A120155
- Number of isomorphism classes of connected 6-regular loopless multigraphs of order n.at n=7A129421
- 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, -1, 0), (-1, 0, 0), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149399
- a(n) = n^3 - (3*(n+3))^2.at n=28A153259
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2>x*y*z.at n=17A212066
- Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step pattern up, down, down, up; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-2)/3)), read by rows.at n=16A230695
- Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down; triangle T(n,k), n>=0, read by rows.at n=20A242783
- Positions of record high water marks in A246024.at n=33A246026
- Number of permutations of [n] with exactly two (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down.at n=2A246222
- Numbers k such that 6^k + 17 is prime.at n=18A309527
- Number of connected n-regular loopless multigraphs on eight unlabeled nodes.at n=6A325474
- Array read by antidiagonals: T(n,r) is the number of connected r-regular loopless multigraphs on n unlabeled nodes.at n=113A328682