16305
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
- 8
- Divisor Sum
- 26112
- Proper Divisor Sum (Aliquot Sum)
- 9807
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8688
- Möbius Function
- -1
- Radical
- 16305
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- 11*n^2 + 11*n + 3.at n=38A006222
- a(n) = A027011(2n+1, n+4).at n=4A027019
- a(n) = T(n, 2*n-7), T given by A027960.at n=11A027969
- Number of proper factorizations of p1^n*p2^6, where p1 and p2 are distinct primes.at n=12A031129
- Numbers whose base-5 representation has exactly 7 runs.at n=20A043607
- The number k(GL(n,q)) of conjugacy classes in GL(n,q), q=4.at n=7A049314
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A005773(n+1)= 1,2,5,13,35,96,267,...at n=47A171488
- Number of partitions of n having depth 3; see Comments.at n=51A237978
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=20A241049
- Number of length n+2 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=43A255993
- G.f. satisfies: A(x) = x + A( A(x)^2 - A(x)^6 ).at n=9A275756
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=13A289529
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 - x^j)/(1 - k*x^j).at n=73A319753
- Number of subsets of {1..n} that cannot be linearly combined using positive coefficients to obtain n.at n=14A365322
- Position of 30^n among 5-smooth numbers A051037.at n=14A372400