16135
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22176
- Proper Divisor Sum (Aliquot Sum)
- 6041
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11040
- Möbius Function
- -1
- Radical
- 16135
- 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
- 71
- 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
- Array described in A062704 read by diagonals in direction of creation.at n=43A062705
- The array of A062704 read by diagonals in the 'up' direction.at n=37A062706
- Indices of zeros in A079777.at n=12A073853
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=23A076164
- Maximum sum of products of successive pairs in a permutation of order n+1.at n=35A101986
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,-1)-returns to the horizontal axis. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=42A182896
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 4.at n=40A210376
- Dimensions of totally primitive elements of Hopf algebra UBP*.at n=6A230890
- Number of magic labelings with magic sum n of 3rd graph shown in link.at n=8A244871
- Expansion of 1/(Sum_{i>=0} q^(2*i*(i+1))/Product_{j=0..i} (1 + q^(2*j+1) + q^(4*j+2))).at n=56A294600