8307
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 4797
- 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
- 5040
- Möbius Function
- 0
- Radical
- 2769
- 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
- 65
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Non-seed mu-atoms of period n in Mandelbrot set.at n=27A006875
- Fibonacci sequence beginning 1, 13.at n=15A022103
- Least term in period of continued fraction for sqrt(n) is 7.at n=15A031431
- Numbers k such that phi(k) is equal to A008473(k).at n=9A039779
- Numbers n such that 103*2^n-1 is prime.at n=18A050577
- 5-morphic but not bimorphic, automorphic nor trimorphic.at n=42A056036
- Number of proper T_1-hypergraphs with 3 labeled nodes and n hyperedges.at n=13A056078
- Numbers k such that k^4 == 1 (mod 5^5).at n=10A056102
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.at n=27A057654
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).at n=25A068473
- Numbers k such that phi(k) = Sum_{d|k} core(d) where core(x) is the squarefree part of x (A007913).at n=7A074786
- Smallest multiple of the n-th prime such that every partial sum is a square.at n=19A085039
- a(n) = n*F(n) + (n-1)*F(n-1).at n=13A136376
- 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, 1, -1), (0, 1, 0), (1, -1, 1), (1, 1, -1)}.at n=9A148402
- 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, 0), (-1, 0, 1), (1, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A149803
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 1), (0, 1), (1, -1)}.at n=11A151256
- a(n) = 49*n^2 + 2*n.at n=12A157365
- Numbers n such that n^2 + 1 is divisible by a 4th power.at n=27A218563
- Numbers n such that n^2 + 1 is divisible by a 5th power.at n=5A218564
- Number of nX4 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=7A240758