5307
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7440
- Proper Divisor Sum (Aliquot Sum)
- 2133
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- -1
- Radical
- 5307
- Omega Function (Ω)
- 3
- 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
- 147
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Dowling numbers: e.g.f. exp(x + (exp(b*x)-1)/b) with b=5.at n=5A003577
- Powers of fourth root of 14 rounded down.at n=13A018084
- Pseudoprimes to base 62.at n=36A020190
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=14A020445
- a(n) = (d(n)-r(n))/2, where d = A026043 and r is the periodic sequence with fundamental period (1,1,0,0).at n=28A026044
- Molien series for complete weight enumerator of self-dual code over GF(5).at n=30A028344
- a(n) = a(n-1) + a(floor(n/2)), a(1) = 1.at n=50A033485
- Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+5} (1 - q^k)).at n=25A035301
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).at n=75A036876
- Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,3.at n=4A037635
- 15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.at n=29A051867
- Smallest number k such that A065422(k)/A065422(k+1) = k^n, where k>1.at n=4A070970
- Index of the first occurrence of prime(n) in A092938.at n=48A092939
- Let a(1) = 1, a(2) = 2, a(3) = 7, a(4) = 15 and for n >= 5 set a(n) = (n*b(n) - b(n-2)) / 2, where b(n) = 4*b(n-2) - b(n-4) for n >= 5 and b(1) = 1, b(2) = 2, b(3) = 5, b(4) = 8.at n=10A093652
- Number of permutations of length n which avoid the patterns 2314, 4132, 4321.at n=8A116748
- Number of partitions of n into at least two parts such that the product of largest and smallest part does not exceed n.at n=30A116901
- Numbers k such that k and k^2 together contain all ten digits.at n=8A122477
- Numbers k for which 8*k+1, 8*k+5 and 8*k+7 are primes.at n=32A123980
- Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=13A123983
- a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)).at n=25A131205