7024
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 13640
- Proper Divisor Sum (Aliquot Sum)
- 6616
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3504
- Möbius Function
- 0
- Radical
- 878
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 57
- 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+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=36A003318
- Series for second perpendicular moment of hexagonal lattice.at n=7A006738
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+7 or 16k-7.at n=49A036023
- Number of topologies on n labeled elements in which no element belongs to any pair of noncomparable members of the topology.at n=6A122835
- a(0)=1; for n > 0, a(n) = a(n-1) + a(prime(n)(mod n)), where prime(n) is the n-th prime.at n=39A127066
- a(n) = a(n-1) + a(n-2) + 2a(n-3).at n=14A140295
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock differing from the number in all its horizontal and vertical neighbors.at n=11A205066
- Number of partitions p of n such that (number of numbers in p of form 3k) = (number of numbers in p of form 3k+1).at n=38A241744
- Number of length 4+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=8A250279
- Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=10A252386
- Decimal representation of the n-th iteration of the "Rule 121" elementary cellular automaton starting with a single ON (black) cell.at n=6A267294
- Numbers n such that Bernoulli number B_{n} has denominator 510.at n=44A271634
- a(n) is the greatest integer k such that k/Fibonacci(n) < e.at n=18A293674
- a(n) is the integer k that minimizes |e - k/Fibonacci(n)|.at n=18A293676
- Number of nX4 0..1 arrays with every element equal to 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=7A297955
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=58A297959
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=62A297959
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=58A298775
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=62A298775
- a(n) = number of distinct words arising in Post's tag system {00, 1101} applied to the word (100)^n , or a(n) = -1 if this word has an unbounded trajectory.at n=26A302202