16506
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 41184
- Proper Divisor Sum (Aliquot Sum)
- 24678
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4680
- Möbius Function
- 0
- Radical
- 5502
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=30A037167
- a(n) = number of lattice paths from (0,0,0) to (n,n,n) along the cracks on the surface of a Rubik-ized n X n X n cube so that no step increases distance from goal.at n=5A060774
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=41A083752
- a(n) = (5*n+1)*(5*n+6).at n=25A085025
- Numbers whose set of base 7 digits is {0,6}.at n=26A097253
- Indices of primes in A001644 (the Lucas 3-step numbers).at n=28A104576
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=10A148169
- Number of nX3 binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=7A183511
- Number of nX8 binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=2A183516
- T(n,k)=Number of nXk binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=47A183517
- T(n,k)=Number of nXk binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=52A183517
- Record (maximal) gaps between prime triples (p, p+4, p+6).at n=32A201596
- Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant = 0 (mod 3).at n=13A211033
- Number A(n,k) of lattice paths without interior points from {n}^k to {0}^k using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=41A225094
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=38A225866
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 2.at n=40A241647
- Number of orbits of Aut(Z^7) as function of the infinity norm n of the representative lattice point of the orbit, when the cardinality of the orbit is equal to 26880.at n=28A266397
- The difference between the two largest distinct parts of a partition (0 if no distinct parts), summed over all partitions of n.at n=27A268191
- Expansion of r(q)^3 / r(q^3) in powers of q where r() is the Rogers-Ramanujan continued fraction.at n=42A285628
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=41A294870