16575
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 14673
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7680
- Möbius Function
- 0
- Radical
- 3315
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 66
- Smith Number
- no
- 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
- Numerators in expansion of (1-x)^{-1/4}.at n=7A004130
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-1)/3.at n=17A048010
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-2)/3.at n=17A048021
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-3)/3.at n=17A048032
- a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=25A059270
- Smallest of 4 consecutive numbers each divisible by a square.at n=27A070284
- Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 22 ways.at n=8A097103
- a(n) = (n-2)^4 - a(n-1) - a(n-2), with a(1) = a(2) = 0.at n=15A152729
- The number of odd numbers that require n Collatz (3x+1) iterations to reach 1.at n=50A176866
- a(n) = (2*n+1)*(6*n-1).at n=37A179741
- Smallest k such that sopf(k)<=sopf(k+1)<=...<=sopf(k+n).at n=6A189882
- Number of (w,x,y,z) with all terms in {0,...,n} and at least one of them is the range of {w,x,y,z}.at n=13A212746
- Number of 3 X 3 X 3 triangular 0..n arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value.at n=31A215183
- Number of partitions of n such that the number of parts is a part and the number of distinct parts is not a part.at n=50A241379
- a(n) = pg(3, n) + pg(4, n) + ... + pg(n, n) where pg(m, n) is the n-th m-th-order polygonal number.at n=17A241452
- Numbers n which appear at least twice in A037278(n), concatenation of their divisors written in base 10.at n=29A248323
- Rectangular array: row n gives the numerators in the positive convolutory n-th root of (1,1,1,...).at n=58A255811
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood.at n=34A272989
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 569", based on the 5-celled von Neumann neighborhood.at n=24A272993
- Least number k such that k*n is the sum of two nonzero squares in exactly n ways.at n=5A273545