16406
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26544
- Proper Divisor Sum (Aliquot Sum)
- 10138
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- -1
- Radical
- 16406
- 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
- 159
- 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
- yes
- Odd
- no
Appears in sequences
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10).at n=22A023440
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=24A027847
- Numbers whose base-7 representation contains exactly four 5's.at n=29A043416
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=15A045036
- n*10^5-1, n*10^5-3, n*10^5-7 and n*10^5-9 are all prime.at n=4A064979
- Total number of distinct cycles in a particular cellular automata of size n.at n=22A083843
- a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.at n=26A092185
- Dispersion of A016861, (5k+1), by antidiagonals.at n=49A191703
- Number of steps to reach 0 when starting from 2^n and iterating the map x -> x - (number of 1's in binary representation of x): a(n) = A071542(2^n) = A218600(n)+1.at n=17A213710
- Number of compositions of n into parts with multiplicity not larger than 4.at n=16A243082
- Numbers n such that n!3 + 3^10 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=26A261145
- a(n) = Sum_{d|n} d^3*A000593(n/d).at n=24A288419
- Number of n X 3 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A317606
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A317611
- Numbers k such that 423*2^k+1 is prime.at n=34A323112
- Records of A058249: (Smallest prime >= 2^n) - (largest prime <= 2^n).at n=36A331620
- Shortest distance from curve start to end along the segments of dragon curve expansion level n, and which is the diameter of the curve as a graph.at n=25A343949
- Expansion of (theta_3(x) - 1)^5 / (16 * (3 - theta_3(x))).at n=25A347808