6576
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 17112
- Proper Divisor Sum (Aliquot Sum)
- 10536
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2176
- Möbius Function
- 0
- Radical
- 822
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 137
- 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
- First occurrence of n consecutive numbers that take same number of steps to reach 1 in 3x+1 problem.at n=10A000546
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=51A011901
- Number of primes between n*100000 and (n+1)*100000.at n=35A038825
- Difference between partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).at n=23A056870
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=20A060674
- Multiples of 24 whose digits also sum to 24.at n=18A066270
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=14A070123
- Numbers k such that k+1, k^2+1 and k^4+1 are primes.at n=27A070325
- Sum of numbers that cannot be written as t*p(n) + u*p(n+1) for nonnegative integers t, u, where p(n) is the n-th prime.at n=5A076429
- Illustration of Viswanath's constant A078416.at n=10A083404
- Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=15A096000
- Numbers k such that k = (d_1! + d_2! + ... + d_k!) - (d_1 + d_2 + ... + d_k) where d_1 d_2 ... d_k is the decimal expansion of k.at n=2A097642
- Indices of primes in sequence defined by A(0) = 53, A(n) = 10*A(n-1) + 43 for n > 0.at n=10A101585
- G.f.: 1/(1 -2 x^3 - x^4 + x^5).at n=32A122518
- a(n) = n-th prime * n-th nonprime.at n=32A127118
- Complete list of solutions to y^2 = x^3 + 225; sequence gives y values.at n=11A134102
- 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), (-1, 1, 0), (1, -1, 0), (1, 1, 0)}.at n=8A149146
- 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, 0), (-1, 1, -1), (0, 1, 0), (1, -1, 1), (1, 1, 0)}.at n=7A150374
- a(n) = 9^n + 2^n - 1.at n=4A155593
- Number of ways to place 4 nonattacking zebras on a 4 X n board.at n=5A172222