16071
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
- 23424
- Proper Divisor Sum (Aliquot Sum)
- 7353
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- -1
- Radical
- 16071
- 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
- 45
- 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
- -1 + Sum (k-1)! C(n,k), k = 1..n for n > 0, a(0) = 1.at n=8A001338
- a(n) = (n+1)*(n+2)*(n+3)*(n+4)*(5*n^2 + 19*n + 15)/360.at n=8A107963
- Floor(sqrt(2*3^n)).at n=17A221944
- Dimension of invariants of 2n-th tensor power of 6-dimensional irreducible representation of A_3.at n=6A247591
- Index of the smallest triangular number greater than 3^n.at n=17A266498
- Number of 8-element subsets of [n] having a prime element sum.at n=11A320683
- a(n) = Sum_{d|n} phi(d^n), where phi() is the Euler totient function (A000010).at n=5A321349
- First term of n-th difference sequence of (floor(k/e)), k >= 0.at n=16A325748
- First term of n-th difference sequence of (floor(r*k)), r = (1+sqrt(3))/2, k >= 0.at n=16A325750
- a(n) = -a(n-1) - a(n-2) + 2*a(n-3) with a(0)=3, a(1)=-1, a(2)=-1.at n=20A331890
- Expansion of Product_{k>=1} (1 + x^k)^binomial(k+2,2).at n=10A338645
- Number of integer partitions of n such that the maximum is greater than or equal to twice the median.at n=35A361859
- Number of distinct integers of the form (x^n + y^n) mod n^4.at n=35A366420